./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4ebc1fb9eba41c231393a5884ecb89fb8b7e4768600ef8a85dd877844861ace
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-09 03:15:00,443 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 03:15:00,444 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-09 03:15:00,465 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-09 03:15:00,465 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-09 03:15:00,466 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-09 03:15:00,467 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-09 03:15:00,468 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-09 03:15:00,469 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-09 03:15:00,470 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-09 03:15:00,470 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-09 03:15:00,471 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-09 03:15:00,471 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-09 03:15:00,472 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-09 03:15:00,473 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-09 03:15:00,474 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-09 03:15:00,474 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-09 03:15:00,475 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-09 03:15:00,476 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-09 03:15:00,477 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-09 03:15:00,478 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-09 03:15:00,479 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-09 03:15:00,480 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-09 03:15:00,480 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-09 03:15:00,482 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-09 03:15:00,483 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-09 03:15:00,483 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-09 03:15:00,483 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-09 03:15:00,484 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-09 03:15:00,490 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-09 03:15:00,490 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-09 03:15:00,491 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-09 03:15:00,492 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-09 03:15:00,492 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-09 03:15:00,493 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-09 03:15:00,493 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-09 03:15:00,493 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-09 03:15:00,494 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-09 03:15:00,494 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-09 03:15:00,494 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-09 03:15:00,495 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-09 03:15:00,496 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 03:15:00,511 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-09 03:15:00,511 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 03:15:00,511 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 03:15:00,511 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 03:15:00,512 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 03:15:00,512 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 03:15:00,512 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-09 03:15:00,513 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 03:15:00,513 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 03:15:00,514 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 03:15:00,514 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:15:00,515 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 03:15:00,515 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 03:15:00,516 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 03:15:00,516 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-09 03:15:00,516 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4ebc1fb9eba41c231393a5884ecb89fb8b7e4768600ef8a85dd877844861ace
[2024-03-09 03:15:00,688 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 03:15:00,706 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 03:15:00,708 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 03:15:00,708 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-09 03:15:00,709 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-09 03:15:00,710 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-09 03:15:01,697 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 03:15:01,926 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-09 03:15:01,926 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-09 03:15:01,937 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/76cc7b402/f9bf88bdf41846c19271e2ccafe7f9c0/FLAGa6cb4a5ee
[2024-03-09 03:15:02,298 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/76cc7b402/f9bf88bdf41846c19271e2ccafe7f9c0
[2024-03-09 03:15:02,305 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 03:15:02,306 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 03:15:02,307 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 03:15:02,307 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 03:15:02,311 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 03:15:02,311 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,312 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e20f50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02, skipping insertion in model container
[2024-03-09 03:15:02,316 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,334 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-09 03:15:02,380 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-09 03:15:02,488 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:15:02,618 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-03-09 03:15:02,622 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:15:02,629 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-09 03:15:02,639 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:15:02,659 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-03-09 03:15:02,664 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:15:02,700 INFO  L208         MainTranslator]: Completed translation
[2024-03-09 03:15:02,700 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02 WrapperNode
[2024-03-09 03:15:02,700 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 03:15:02,701 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 03:15:02,701 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 03:15:02,701 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 03:15:02,706 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,721 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,739 INFO  L138                Inliner]: procedures = 278, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103
[2024-03-09 03:15:02,740 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 03:15:02,740 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 03:15:02,740 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 03:15:02,740 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 03:15:02,747 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,747 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,751 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,751 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,759 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,761 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,763 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,764 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,767 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 03:15:02,767 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 03:15:02,767 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 03:15:02,768 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-09 03:15:02,768 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (1/1) ...
[2024-03-09 03:15:02,773 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:15:02,781 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:15:02,792 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:02,802 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-09 03:15:02,827 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 03:15:02,828 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 03:15:02,828 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 03:15:02,829 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 03:15:02,829 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-09 03:15:02,990 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-09 03:15:02,991 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 03:15:03,246 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-09 03:15:03,253 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 03:15:03,254 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 03:15:03,256 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:15:03 BoogieIcfgContainer
[2024-03-09 03:15:03,256 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 03:15:03,259 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 03:15:03,259 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 03:15:03,262 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-09 03:15:03,262 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:15:02" (1/3) ...
[2024-03-09 03:15:03,263 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70388362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:15:03, skipping insertion in model container
[2024-03-09 03:15:03,263 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:02" (2/3) ...
[2024-03-09 03:15:03,263 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70388362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:15:03, skipping insertion in model container
[2024-03-09 03:15:03,263 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:15:03" (3/3) ...
[2024-03-09 03:15:03,264 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-03-09 03:15:03,282 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 03:15:03,292 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 03:15:03,292 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-09 03:15:03,292 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 03:15:03,347 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 03:15:03,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2024-03-09 03:15:03,439 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2024-03-09 03:15:03,439 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:15:03,444 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 414 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2024-03-09 03:15:03,444 INFO  L82        GeneralOperation]: Start removeDead. Operand has 147 places, 149 transitions, 306 flow
[2024-03-09 03:15:03,448 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 306 flow
[2024-03-09 03:15:03,451 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 03:15:03,459 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 306 flow
[2024-03-09 03:15:03,461 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 306 flow
[2024-03-09 03:15:03,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2024-03-09 03:15:03,498 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2024-03-09 03:15:03,498 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:15:03,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 414 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2024-03-09 03:15:03,501 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3942
[2024-03-09 03:15:06,423 INFO  L134        LiptonReduction]: Checked pairs total: 25146
[2024-03-09 03:15:06,423 INFO  L136        LiptonReduction]: Total number of compositions: 95
[2024-03-09 03:15:06,435 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 03:15:06,440 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76bde98e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 03:15:06,440 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-09 03:15:06,441 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-09 03:15:06,441 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 03:15:06,441 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:06,442 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-09 03:15:06,442 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:06,446 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:06,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 477, now seen corresponding path program 1 times
[2024-03-09 03:15:06,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:06,453 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753100349]
[2024-03-09 03:15:06,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:06,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:06,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:06,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:06,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:06,532 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753100349]
[2024-03-09 03:15:06,533 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753100349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:06,533 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:06,533 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-09 03:15:06,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30264326]
[2024-03-09 03:15:06,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:06,541 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-09 03:15:06,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:06,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-09 03:15:06,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-09 03:15:06,559 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 244
[2024-03-09 03:15:06,561 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,561 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:06,561 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 244
[2024-03-09 03:15:06,562 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:06,635 INFO  L130       PetriNetUnfolder]: 85/397 cut-off events.
[2024-03-09 03:15:06,635 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-09 03:15:06,636 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 606 conditions, 397 events. 85/397 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2115 event pairs, 84 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 536. Up to 203 conditions per place. 
[2024-03-09 03:15:06,638 INFO  L137   encePairwiseOnDemand]: 243/244 looper letters, 23 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2024-03-09 03:15:06,638 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 186 flow
[2024-03-09 03:15:06,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-09 03:15:06,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-09 03:15:06,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions.
[2024-03-09 03:15:06,649 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6352459016393442
[2024-03-09 03:15:06,650 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 310 transitions.
[2024-03-09 03:15:06,650 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions.
[2024-03-09 03:15:06,651 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:06,653 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions.
[2024-03-09 03:15:06,655 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,673 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,674 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,676 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 310 transitions.
[2024-03-09 03:15:06,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 186 flow
[2024-03-09 03:15:06,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:06,683 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2024-03-09 03:15:06,684 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-03-09 03:15:06,687 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2024-03-09 03:15:06,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2024-03-09 03:15:06,688 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,688 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:06,688 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-09 03:15:06,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 03:15:06,688 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:06,689 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:06,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 471775, now seen corresponding path program 1 times
[2024-03-09 03:15:06,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:06,690 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807072241]
[2024-03-09 03:15:06,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:06,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:06,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:06,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:06,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:06,771 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807072241]
[2024-03-09 03:15:06,771 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807072241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:06,771 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:06,771 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:06,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225136005]
[2024-03-09 03:15:06,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:06,772 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:06,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:06,773 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:06,773 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:06,800 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 244
[2024-03-09 03:15:06,801 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,801 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:06,801 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 244
[2024-03-09 03:15:06,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:06,893 INFO  L130       PetriNetUnfolder]: 151/517 cut-off events.
[2024-03-09 03:15:06,893 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-09 03:15:06,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 881 conditions, 517 events. 151/517 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2674 event pairs, 76 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 877. Up to 190 conditions per place. 
[2024-03-09 03:15:06,896 INFO  L137   encePairwiseOnDemand]: 233/244 looper letters, 47 selfloop transitions, 8 changer transitions 0/90 dead transitions.
[2024-03-09 03:15:06,896 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 298 flow
[2024-03-09 03:15:06,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:06,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:06,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions.
[2024-03-09 03:15:06,898 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6202185792349727
[2024-03-09 03:15:06,899 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 454 transitions.
[2024-03-09 03:15:06,899 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions.
[2024-03-09 03:15:06,899 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:06,899 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions.
[2024-03-09 03:15:06,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,903 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,903 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 454 transitions.
[2024-03-09 03:15:06,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 298 flow
[2024-03-09 03:15:06,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:06,905 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2024-03-09 03:15:06,905 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2024-03-09 03:15:06,905 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2024-03-09 03:15:06,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2024-03-09 03:15:06,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,906 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:06,906 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:06,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 03:15:06,906 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:06,907 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:06,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 1251069495, now seen corresponding path program 1 times
[2024-03-09 03:15:06,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:06,907 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858308047]
[2024-03-09 03:15:06,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:06,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:06,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:06,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:06,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:06,956 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858308047]
[2024-03-09 03:15:06,956 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858308047] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:06,956 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:06,956 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:06,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563113491]
[2024-03-09 03:15:06,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:06,957 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:06,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:06,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:06,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:06,979 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 244
[2024-03-09 03:15:06,979 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:06,979 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:06,980 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 244
[2024-03-09 03:15:06,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:07,055 INFO  L130       PetriNetUnfolder]: 135/505 cut-off events.
[2024-03-09 03:15:07,055 INFO  L131       PetriNetUnfolder]: For 97/97 co-relation queries the response was YES.
[2024-03-09 03:15:07,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 994 conditions, 505 events. 135/505 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2685 event pairs, 106 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 988. Up to 291 conditions per place. 
[2024-03-09 03:15:07,058 INFO  L137   encePairwiseOnDemand]: 239/244 looper letters, 37 selfloop transitions, 6 changer transitions 0/84 dead transitions.
[2024-03-09 03:15:07,058 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 326 flow
[2024-03-09 03:15:07,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:07,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:07,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions.
[2024-03-09 03:15:07,060 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5956284153005464
[2024-03-09 03:15:07,060 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 436 transitions.
[2024-03-09 03:15:07,060 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions.
[2024-03-09 03:15:07,060 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:07,060 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions.
[2024-03-09 03:15:07,062 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,064 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,064 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 3 states and 436 transitions.
[2024-03-09 03:15:07,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 326 flow
[2024-03-09 03:15:07,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:07,067 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 236 flow
[2024-03-09 03:15:07,067 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2024-03-09 03:15:07,068 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2024-03-09 03:15:07,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 236 flow
[2024-03-09 03:15:07,068 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,068 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:07,068 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:07,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 03:15:07,069 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:07,069 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:07,069 INFO  L85        PathProgramCache]: Analyzing trace with hash -1247228974, now seen corresponding path program 1 times
[2024-03-09 03:15:07,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:07,069 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617544275]
[2024-03-09 03:15:07,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:07,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:07,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:07,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:07,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:07,151 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617544275]
[2024-03-09 03:15:07,151 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617544275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:07,151 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:07,151 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 03:15:07,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801360237]
[2024-03-09 03:15:07,152 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:07,152 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 03:15:07,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:07,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 03:15:07,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 03:15:07,215 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 244
[2024-03-09 03:15:07,216 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 236 flow. Second operand  has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,216 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:07,216 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 244
[2024-03-09 03:15:07,216 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:07,307 INFO  L130       PetriNetUnfolder]: 109/492 cut-off events.
[2024-03-09 03:15:07,307 INFO  L131       PetriNetUnfolder]: For 83/92 co-relation queries the response was YES.
[2024-03-09 03:15:07,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 924 conditions, 492 events. 109/492 cut-off events. For 83/92 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2672 event pairs, 71 based on Foata normal form. 8/464 useless extension candidates. Maximal degree in co-relation 917. Up to 223 conditions per place. 
[2024-03-09 03:15:07,309 INFO  L137   encePairwiseOnDemand]: 240/244 looper letters, 41 selfloop transitions, 3 changer transitions 1/95 dead transitions.
[2024-03-09 03:15:07,310 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 95 transitions, 371 flow
[2024-03-09 03:15:07,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 03:15:07,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 03:15:07,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions.
[2024-03-09 03:15:07,311 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6034836065573771
[2024-03-09 03:15:07,312 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 589 transitions.
[2024-03-09 03:15:07,312 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions.
[2024-03-09 03:15:07,312 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:07,312 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions.
[2024-03-09 03:15:07,313 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,315 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,316 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,316 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 236 flow. Second operand 4 states and 589 transitions.
[2024-03-09 03:15:07,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 95 transitions, 371 flow
[2024-03-09 03:15:07,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 03:15:07,319 INFO  L231             Difference]: Finished difference. Result has 78 places, 79 transitions, 246 flow
[2024-03-09 03:15:07,319 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=78, PETRI_TRANSITIONS=79}
[2024-03-09 03:15:07,320 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 9 predicate places.
[2024-03-09 03:15:07,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 246 flow
[2024-03-09 03:15:07,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,321 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:07,321 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:07,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 03:15:07,321 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:07,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:07,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -1097829877, now seen corresponding path program 1 times
[2024-03-09 03:15:07,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:07,322 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133871592]
[2024-03-09 03:15:07,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:07,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:07,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:07,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:07,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:07,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133871592]
[2024-03-09 03:15:07,528 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133871592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:07,528 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:07,529 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:15:07,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091942090]
[2024-03-09 03:15:07,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:07,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:15:07,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:07,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:15:07,530 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:15:07,676 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 244
[2024-03-09 03:15:07,677 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 246 flow. Second operand  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,678 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:07,678 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 244
[2024-03-09 03:15:07,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:07,956 INFO  L130       PetriNetUnfolder]: 414/1219 cut-off events.
[2024-03-09 03:15:07,957 INFO  L131       PetriNetUnfolder]: For 188/198 co-relation queries the response was YES.
[2024-03-09 03:15:07,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1219 events. 414/1219 cut-off events. For 188/198 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7973 event pairs, 119 based on Foata normal form. 9/1178 useless extension candidates. Maximal degree in co-relation 2504. Up to 532 conditions per place. 
[2024-03-09 03:15:07,962 INFO  L137   encePairwiseOnDemand]: 221/244 looper letters, 88 selfloop transitions, 29 changer transitions 0/147 dead transitions.
[2024-03-09 03:15:07,962 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 648 flow
[2024-03-09 03:15:07,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:15:07,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:15:07,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions.
[2024-03-09 03:15:07,965 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5614754098360656
[2024-03-09 03:15:07,965 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 822 transitions.
[2024-03-09 03:15:07,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions.
[2024-03-09 03:15:07,966 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:07,966 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions.
[2024-03-09 03:15:07,968 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,971 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,971 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,972 INFO  L175             Difference]: Start difference. First operand has 78 places, 79 transitions, 246 flow. Second operand 6 states and 822 transitions.
[2024-03-09 03:15:07,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 648 flow
[2024-03-09 03:15:07,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 03:15:07,977 INFO  L231             Difference]: Finished difference. Result has 87 places, 108 transitions, 464 flow
[2024-03-09 03:15:07,978 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=87, PETRI_TRANSITIONS=108}
[2024-03-09 03:15:07,980 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 18 predicate places.
[2024-03-09 03:15:07,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 464 flow
[2024-03-09 03:15:07,981 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:07,981 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:07,982 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:07,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 03:15:07,982 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:07,982 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:07,982 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547560211, now seen corresponding path program 1 times
[2024-03-09 03:15:07,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:07,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303365669]
[2024-03-09 03:15:07,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:07,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:08,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:08,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:08,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:08,024 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303365669]
[2024-03-09 03:15:08,024 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303365669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:08,024 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:08,024 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:08,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069969503]
[2024-03-09 03:15:08,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:08,025 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:08,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:08,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:08,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:08,036 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 244
[2024-03-09 03:15:08,037 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 108 transitions, 464 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:08,037 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:08,037 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 244
[2024-03-09 03:15:08,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:08,153 INFO  L130       PetriNetUnfolder]: 214/826 cut-off events.
[2024-03-09 03:15:08,153 INFO  L131       PetriNetUnfolder]: For 264/292 co-relation queries the response was YES.
[2024-03-09 03:15:08,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 826 events. 214/826 cut-off events. For 264/292 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5418 event pairs, 31 based on Foata normal form. 32/832 useless extension candidates. Maximal degree in co-relation 1951. Up to 343 conditions per place. 
[2024-03-09 03:15:08,157 INFO  L137   encePairwiseOnDemand]: 240/244 looper letters, 42 selfloop transitions, 2 changer transitions 1/118 dead transitions.
[2024-03-09 03:15:08,157 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 118 transitions, 588 flow
[2024-03-09 03:15:08,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:08,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:08,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions.
[2024-03-09 03:15:08,159 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6092896174863388
[2024-03-09 03:15:08,159 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 446 transitions.
[2024-03-09 03:15:08,159 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions.
[2024-03-09 03:15:08,160 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:08,160 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions.
[2024-03-09 03:15:08,161 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:08,163 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:08,163 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:08,163 INFO  L175             Difference]: Start difference. First operand has 87 places, 108 transitions, 464 flow. Second operand 3 states and 446 transitions.
[2024-03-09 03:15:08,163 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 118 transitions, 588 flow
[2024-03-09 03:15:08,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 118 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:08,177 INFO  L231             Difference]: Finished difference. Result has 88 places, 107 transitions, 468 flow
[2024-03-09 03:15:08,177 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=88, PETRI_TRANSITIONS=107}
[2024-03-09 03:15:08,179 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2024-03-09 03:15:08,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 468 flow
[2024-03-09 03:15:08,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:08,186 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:08,186 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:08,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 03:15:08,187 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:08,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:08,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 822809479, now seen corresponding path program 1 times
[2024-03-09 03:15:08,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:08,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372254881]
[2024-03-09 03:15:08,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:08,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:08,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:08,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:08,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:08,452 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372254881]
[2024-03-09 03:15:08,452 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372254881] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:08,452 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:08,452 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:15:08,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55754748]
[2024-03-09 03:15:08,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:08,453 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:15:08,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:08,453 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:15:08,453 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:15:08,559 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244
[2024-03-09 03:15:08,560 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 468 flow. Second operand  has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:08,560 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:08,560 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244
[2024-03-09 03:15:08,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:09,035 INFO  L130       PetriNetUnfolder]: 582/1545 cut-off events.
[2024-03-09 03:15:09,036 INFO  L131       PetriNetUnfolder]: For 749/770 co-relation queries the response was YES.
[2024-03-09 03:15:09,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4276 conditions, 1545 events. 582/1545 cut-off events. For 749/770 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10451 event pairs, 180 based on Foata normal form. 12/1477 useless extension candidates. Maximal degree in co-relation 4262. Up to 987 conditions per place. 
[2024-03-09 03:15:09,043 INFO  L137   encePairwiseOnDemand]: 221/244 looper letters, 126 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2024-03-09 03:15:09,043 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 1434 flow
[2024-03-09 03:15:09,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:15:09,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:15:09,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions.
[2024-03-09 03:15:09,045 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5853825136612022
[2024-03-09 03:15:09,045 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 857 transitions.
[2024-03-09 03:15:09,045 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions.
[2024-03-09 03:15:09,046 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:09,046 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions.
[2024-03-09 03:15:09,047 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,049 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,049 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,049 INFO  L175             Difference]: Start difference. First operand has 88 places, 107 transitions, 468 flow. Second operand 6 states and 857 transitions.
[2024-03-09 03:15:09,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 241 transitions, 1434 flow
[2024-03-09 03:15:09,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1418 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:09,059 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2024-03-09 03:15:09,059 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2024-03-09 03:15:09,060 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2024-03-09 03:15:09,060 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2024-03-09 03:15:09,060 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,060 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:09,060 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:09,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 03:15:09,061 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:09,061 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:09,061 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212328968, now seen corresponding path program 1 times
[2024-03-09 03:15:09,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:09,061 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016125681]
[2024-03-09 03:15:09,061 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:09,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:09,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:09,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:09,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:09,145 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016125681]
[2024-03-09 03:15:09,145 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016125681] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:15:09,145 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109952696]
[2024-03-09 03:15:09,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:09,146 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:15:09,146 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:15:09,152 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:15:09,154 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 03:15:09,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:09,239 INFO  L263         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 03:15:09,244 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:09,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:09,315 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:15:09,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:09,361 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109952696] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:15:09,362 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:15:09,362 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-09 03:15:09,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526486884]
[2024-03-09 03:15:09,362 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:15:09,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 03:15:09,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:09,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 03:15:09,363 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 03:15:09,470 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 244
[2024-03-09 03:15:09,471 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 9 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,471 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:09,471 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 244
[2024-03-09 03:15:09,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:09,654 INFO  L130       PetriNetUnfolder]: 275/983 cut-off events.
[2024-03-09 03:15:09,654 INFO  L131       PetriNetUnfolder]: For 1041/1078 co-relation queries the response was YES.
[2024-03-09 03:15:09,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 983 events. 275/983 cut-off events. For 1041/1078 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6705 event pairs, 34 based on Foata normal form. 5/963 useless extension candidates. Maximal degree in co-relation 2930. Up to 239 conditions per place. 
[2024-03-09 03:15:09,660 INFO  L137   encePairwiseOnDemand]: 237/244 looper letters, 42 selfloop transitions, 6 changer transitions 12/185 dead transitions.
[2024-03-09 03:15:09,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 185 transitions, 1221 flow
[2024-03-09 03:15:09,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 03:15:09,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 03:15:09,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 975 transitions.
[2024-03-09 03:15:09,662 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5708430913348946
[2024-03-09 03:15:09,663 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 975 transitions.
[2024-03-09 03:15:09,663 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 975 transitions.
[2024-03-09 03:15:09,663 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:09,663 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 975 transitions.
[2024-03-09 03:15:09,665 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,667 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,667 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,667 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 975 transitions.
[2024-03-09 03:15:09,667 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 185 transitions, 1221 flow
[2024-03-09 03:15:09,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 185 transitions, 1161 flow, removed 27 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:09,675 INFO  L231             Difference]: Finished difference. Result has 100 places, 153 transitions, 935 flow
[2024-03-09 03:15:09,676 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=100, PETRI_TRANSITIONS=153}
[2024-03-09 03:15:09,676 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 31 predicate places.
[2024-03-09 03:15:09,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 935 flow
[2024-03-09 03:15:09,677 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 135.77777777777777) internal successors, (1222), 9 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:09,677 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:09,677 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:09,696 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 03:15:09,877 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:15:09,878 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:09,879 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:09,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -859136699, now seen corresponding path program 1 times
[2024-03-09 03:15:09,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:09,881 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946549023]
[2024-03-09 03:15:09,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:09,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:09,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:10,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:10,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:10,204 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946549023]
[2024-03-09 03:15:10,204 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946549023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:10,204 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:10,204 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-09 03:15:10,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843667953]
[2024-03-09 03:15:10,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:10,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 03:15:10,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:10,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 03:15:10,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-09 03:15:10,483 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244
[2024-03-09 03:15:10,483 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 935 flow. Second operand  has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:10,484 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:10,484 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244
[2024-03-09 03:15:10,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:10,815 INFO  L130       PetriNetUnfolder]: 398/1111 cut-off events.
[2024-03-09 03:15:10,815 INFO  L131       PetriNetUnfolder]: For 982/1001 co-relation queries the response was YES.
[2024-03-09 03:15:10,818 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 1111 events. 398/1111 cut-off events. For 982/1001 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7077 event pairs, 130 based on Foata normal form. 30/1105 useless extension candidates. Maximal degree in co-relation 3780. Up to 511 conditions per place. 
[2024-03-09 03:15:10,821 INFO  L137   encePairwiseOnDemand]: 232/244 looper letters, 166 selfloop transitions, 48 changer transitions 0/243 dead transitions.
[2024-03-09 03:15:10,822 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 243 transitions, 1899 flow
[2024-03-09 03:15:10,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 03:15:10,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 03:15:10,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions.
[2024-03-09 03:15:10,824 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5339578454332553
[2024-03-09 03:15:10,824 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 912 transitions.
[2024-03-09 03:15:10,824 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions.
[2024-03-09 03:15:10,825 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:10,825 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions.
[2024-03-09 03:15:10,827 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:10,828 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:10,829 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:10,829 INFO  L175             Difference]: Start difference. First operand has 100 places, 153 transitions, 935 flow. Second operand 7 states and 912 transitions.
[2024-03-09 03:15:10,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 243 transitions, 1899 flow
[2024-03-09 03:15:10,835 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 243 transitions, 1870 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 03:15:10,837 INFO  L231             Difference]: Finished difference. Result has 99 places, 165 transitions, 1209 flow
[2024-03-09 03:15:10,837 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1209, PETRI_PLACES=99, PETRI_TRANSITIONS=165}
[2024-03-09 03:15:10,838 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 30 predicate places.
[2024-03-09 03:15:10,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 165 transitions, 1209 flow
[2024-03-09 03:15:10,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:10,838 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:10,838 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:10,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 03:15:10,839 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:10,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:10,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -1548732089, now seen corresponding path program 1 times
[2024-03-09 03:15:10,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:10,839 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295713118]
[2024-03-09 03:15:10,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:10,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:10,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:11,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:15:11,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:11,102 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295713118]
[2024-03-09 03:15:11,102 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295713118] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:11,102 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:11,102 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-09 03:15:11,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336814066]
[2024-03-09 03:15:11,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:11,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 03:15:11,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:11,103 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 03:15:11,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-09 03:15:11,408 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244
[2024-03-09 03:15:11,409 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 165 transitions, 1209 flow. Second operand  has 8 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,409 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:11,409 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244
[2024-03-09 03:15:11,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:11,557 INFO  L130       PetriNetUnfolder]: 372/1052 cut-off events.
[2024-03-09 03:15:11,557 INFO  L131       PetriNetUnfolder]: For 2044/2064 co-relation queries the response was YES.
[2024-03-09 03:15:11,559 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 1052 events. 372/1052 cut-off events. For 2044/2064 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6585 event pairs, 155 based on Foata normal form. 37/1058 useless extension candidates. Maximal degree in co-relation 4111. Up to 762 conditions per place. 
[2024-03-09 03:15:11,563 INFO  L137   encePairwiseOnDemand]: 237/244 looper letters, 118 selfloop transitions, 5 changer transitions 0/171 dead transitions.
[2024-03-09 03:15:11,563 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 1491 flow
[2024-03-09 03:15:11,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 03:15:11,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 03:15:11,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions.
[2024-03-09 03:15:11,565 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5005854800936768
[2024-03-09 03:15:11,565 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 855 transitions.
[2024-03-09 03:15:11,566 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions.
[2024-03-09 03:15:11,566 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:11,566 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions.
[2024-03-09 03:15:11,568 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,569 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,570 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,570 INFO  L175             Difference]: Start difference. First operand has 99 places, 165 transitions, 1209 flow. Second operand 7 states and 855 transitions.
[2024-03-09 03:15:11,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 1491 flow
[2024-03-09 03:15:11,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 171 transitions, 1461 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:11,600 INFO  L231             Difference]: Finished difference. Result has 105 places, 167 transitions, 1229 flow
[2024-03-09 03:15:11,600 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1229, PETRI_PLACES=105, PETRI_TRANSITIONS=167}
[2024-03-09 03:15:11,601 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 36 predicate places.
[2024-03-09 03:15:11,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1229 flow
[2024-03-09 03:15:11,601 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,601 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:11,601 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:11,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 03:15:11,602 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:11,602 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:11,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 1996787936, now seen corresponding path program 1 times
[2024-03-09 03:15:11,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:11,602 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716798609]
[2024-03-09 03:15:11,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:11,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:11,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:11,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:11,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:11,630 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716798609]
[2024-03-09 03:15:11,630 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716798609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:11,631 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:11,631 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:11,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112123403]
[2024-03-09 03:15:11,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:11,631 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:11,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:11,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:11,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:11,652 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 244
[2024-03-09 03:15:11,652 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 1229 flow. Second operand  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,652 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:11,652 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 244
[2024-03-09 03:15:11,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:11,759 INFO  L130       PetriNetUnfolder]: 301/937 cut-off events.
[2024-03-09 03:15:11,759 INFO  L131       PetriNetUnfolder]: For 2076/2090 co-relation queries the response was YES.
[2024-03-09 03:15:11,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 937 events. 301/937 cut-off events. For 2076/2090 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5868 event pairs, 83 based on Foata normal form. 3/909 useless extension candidates. Maximal degree in co-relation 3484. Up to 341 conditions per place. 
[2024-03-09 03:15:11,764 INFO  L137   encePairwiseOnDemand]: 238/244 looper letters, 42 selfloop transitions, 10 changer transitions 0/180 dead transitions.
[2024-03-09 03:15:11,764 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 180 transitions, 1385 flow
[2024-03-09 03:15:11,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:11,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:11,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions.
[2024-03-09 03:15:11,766 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969945355191257
[2024-03-09 03:15:11,766 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 437 transitions.
[2024-03-09 03:15:11,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions.
[2024-03-09 03:15:11,766 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:11,766 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions.
[2024-03-09 03:15:11,767 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,768 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,768 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,768 INFO  L175             Difference]: Start difference. First operand has 105 places, 167 transitions, 1229 flow. Second operand 3 states and 437 transitions.
[2024-03-09 03:15:11,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 180 transitions, 1385 flow
[2024-03-09 03:15:11,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 180 transitions, 1376 flow, removed 4 selfloop flow, removed 1 redundant places.
[2024-03-09 03:15:11,780 INFO  L231             Difference]: Finished difference. Result has 107 places, 173 transitions, 1292 flow
[2024-03-09 03:15:11,780 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=107, PETRI_TRANSITIONS=173}
[2024-03-09 03:15:11,780 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 38 predicate places.
[2024-03-09 03:15:11,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 173 transitions, 1292 flow
[2024-03-09 03:15:11,781 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:11,781 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:11,781 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:11,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 03:15:11,781 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:11,781 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:11,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 926258341, now seen corresponding path program 1 times
[2024-03-09 03:15:11,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:11,781 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912324747]
[2024-03-09 03:15:11,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:11,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:11,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:11,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:15:11,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:15:11,988 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912324747]
[2024-03-09 03:15:11,989 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912324747] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:11,989 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:11,989 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:15:11,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921514584]
[2024-03-09 03:15:11,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:11,989 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:15:11,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:15:11,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:15:11,990 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:15:12,177 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 244
[2024-03-09 03:15:12,178 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 173 transitions, 1292 flow. Second operand  has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:12,178 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:12,178 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 244
[2024-03-09 03:15:12,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:12,385 INFO  L130       PetriNetUnfolder]: 407/1105 cut-off events.
[2024-03-09 03:15:12,385 INFO  L131       PetriNetUnfolder]: For 2830/2885 co-relation queries the response was YES.
[2024-03-09 03:15:12,388 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 1105 events. 407/1105 cut-off events. For 2830/2885 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6807 event pairs, 98 based on Foata normal form. 21/1099 useless extension candidates. Maximal degree in co-relation 4445. Up to 562 conditions per place. 
[2024-03-09 03:15:12,391 INFO  L137   encePairwiseOnDemand]: 233/244 looper letters, 78 selfloop transitions, 41 changer transitions 36/239 dead transitions.
[2024-03-09 03:15:12,391 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 239 transitions, 2058 flow
[2024-03-09 03:15:12,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:15:12,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:15:12,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions.
[2024-03-09 03:15:12,394 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5758196721311475
[2024-03-09 03:15:12,394 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 843 transitions.
[2024-03-09 03:15:12,394 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 843 transitions.
[2024-03-09 03:15:12,394 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:12,394 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 843 transitions.
[2024-03-09 03:15:12,395 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:12,397 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:12,397 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:12,397 INFO  L175             Difference]: Start difference. First operand has 107 places, 173 transitions, 1292 flow. Second operand 6 states and 843 transitions.
[2024-03-09 03:15:12,397 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 239 transitions, 2058 flow
[2024-03-09 03:15:12,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2042 flow, removed 1 selfloop flow, removed 1 redundant places.
[2024-03-09 03:15:12,420 INFO  L231             Difference]: Finished difference. Result has 116 places, 195 transitions, 1624 flow
[2024-03-09 03:15:12,420 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1624, PETRI_PLACES=116, PETRI_TRANSITIONS=195}
[2024-03-09 03:15:12,420 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 47 predicate places.
[2024-03-09 03:15:12,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 195 transitions, 1624 flow
[2024-03-09 03:15:12,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:12,421 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:12,421 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:12,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 03:15:12,421 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:12,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:12,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -1482144661, now seen corresponding path program 1 times
[2024-03-09 03:15:12,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:15:12,422 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979570671]
[2024-03-09 03:15:12,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:12,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:15:12,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:15:12,442 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 03:15:12,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:15:12,468 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 03:15:12,468 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 03:15:12,469 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2024-03-09 03:15:12,470 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-09 03:15:12,470 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-09 03:15:12,470 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-09 03:15:12,471 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-09 03:15:12,472 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-09 03:15:12,472 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-09 03:15:12,472 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-09 03:15:12,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 03:15:12,472 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:12,476 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-03-09 03:15:12,476 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-09 03:15:12,502 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:15:12 BasicIcfg
[2024-03-09 03:15:12,503 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-09 03:15:12,503 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-09 03:15:12,503 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-09 03:15:12,503 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-09 03:15:12,504 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:15:03" (3/4) ...
[2024-03-09 03:15:12,506 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-09 03:15:12,506 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-09 03:15:12,506 INFO  L158              Benchmark]: Toolchain (without parser) took 10199.87ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 108.4MB in the beginning and 199.9MB in the end (delta: -91.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB.
[2024-03-09 03:15:12,506 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 03:15:12,507 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 393.29ms. Allocated memory is still 146.8MB. Free memory was 108.0MB in the beginning and 79.1MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-03-09 03:15:12,507 INFO  L158              Benchmark]: Boogie Procedure Inliner took 38.49ms. Allocated memory is still 146.8MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 03:15:12,507 INFO  L158              Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 146.8MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 03:15:12,507 INFO  L158              Benchmark]: RCFGBuilder took 489.15ms. Allocated memory is still 146.8MB. Free memory was 74.4MB in the beginning and 114.3MB in the end (delta: -39.9MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB.
[2024-03-09 03:15:12,508 INFO  L158              Benchmark]: TraceAbstraction took 9243.59ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 113.6MB in the beginning and 199.9MB in the end (delta: -86.3MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB.
[2024-03-09 03:15:12,508 INFO  L158              Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 262.1MB. Free memory is still 199.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 03:15:12,509 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 393.29ms. Allocated memory is still 146.8MB. Free memory was 108.0MB in the beginning and 79.1MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 38.49ms. Allocated memory is still 146.8MB. Free memory was 79.1MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 26.76ms. Allocated memory is still 146.8MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 489.15ms. Allocated memory is still 146.8MB. Free memory was 74.4MB in the beginning and 114.3MB in the end (delta: -39.9MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9243.59ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 113.6MB in the beginning and 199.9MB in the end (delta: -86.3MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB.
 * Witness Printer took 2.80ms. Allocated memory is still 262.1MB. Free memory is still 199.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.0s, 147 PlacesBefore, 69 PlacesAfterwards, 149 TransitionsBefore, 67 TransitionsAfterwards, 3942 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 95 TotalNumberOfCompositions, 25146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6899, independent: 6027, independent conditional: 0, independent unconditional: 6027, dependent: 872, dependent conditional: 0, dependent unconditional: 872, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1697, independent: 1595, independent conditional: 0, independent unconditional: 1595, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6899, independent: 4432, independent conditional: 0, independent unconditional: 4432, dependent: 770, dependent conditional: 0, dependent unconditional: 770, unknown: 1697, unknown conditional: 0, unknown unconditional: 1697] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 1051]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: overapproximation of shiftLeft at line 1041, overapproximation of bitwiseOr at line 1041, overapproximation of bitwiseAnd at line 1052, overapproximation of bitwiseComplement at line 1052. 
Possible FailurePath: 
[L1036]               0  int threads_mask = -1;
[L1037]               0  int *datas;
[L1045]               0  int threads_total = __VERIFIER_nondet_int();
[L1046]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1033]  COND FALSE   0  !(!cond)
[L1046]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1047]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1033]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total < 32)
[L1048]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1048]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  datas = malloc(threads_total * sizeof(int))
[L1050]               0  int i = 0;
         VAL             [datas={-3:0}, i=0, threads_mask=-1, threads_total=2, tids={5:0}]
[L1050]  COND TRUE    0  i < threads_total
[L1051]  EXPR         0  ffs(threads_mask)
[L1051]               0  int j = ffs(threads_mask) - 1;
[L1052]               0  threads_mask &= ~(1 << j)
         VAL             [datas={-3:0}, i=0, j=0, threads_mask=-1, threads_total=2, tids={5:0}]
[L1053]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={-2:0}, datas={-3:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=2, tids={5:0}]
[L1053]  EXPR         0  tids[i]
         VAL             [\read(*tids)={-2:0}, datas={-3:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=2, tids={5:0}]
[L1053]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
         VAL             [\read(*tids)={-2:0}, arg={0:0}, datas={-3:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=2, tids={5:0}]
[L1050]               0  i++
         VAL             [arg={0:0}, datas={-3:0}, i=1, j=0, threads_mask=-1, threads_total=2, tids={5:0}]
[L1039]               1  int j = (int)arg;
[L1040]  EXPR         1  datas[j]
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, j=0, threads_mask=-1]
[L1040]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:0}, arg={0:0}, datas={-3:0}, j=0, threads_mask=-1]
[L1050]  COND TRUE    0  i < threads_total
[L1041]               1  threads_mask |= 1 << j
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, j=0, threads_mask=-1, threads_mask |= 1 << j=14]
[L1051]               0  ffs(threads_mask)
         VAL             [arg={0:0}, arg={0:0}, datas={-3:0}, i=1, j=0, j=0, threads_mask=-1, threads_mask |= 1 << j=14, threads_total=2, tids={5:0}]

  - UnprovableResult [Line: 1049]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1056]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1058]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1056]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1040]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1040]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 173 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1314 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 912 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 352 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2832 IncrementalHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 352 mSolverCounterUnsat, 71 mSDtfsCounter, 2832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 4 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-03-09 03:15:12,521 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4ebc1fb9eba41c231393a5884ecb89fb8b7e4768600ef8a85dd877844861ace
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-09 03:15:14,204 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 03:15:14,206 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-09 03:15:14,229 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-09 03:15:14,229 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-09 03:15:14,230 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-09 03:15:14,230 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-09 03:15:14,232 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-09 03:15:14,233 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-09 03:15:14,233 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-09 03:15:14,234 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-09 03:15:14,235 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-09 03:15:14,235 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-09 03:15:14,236 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-09 03:15:14,236 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-09 03:15:14,237 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-09 03:15:14,238 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-09 03:15:14,238 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-09 03:15:14,239 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-09 03:15:14,241 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-09 03:15:14,246 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-09 03:15:14,247 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-09 03:15:14,247 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-09 03:15:14,248 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-09 03:15:14,250 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-09 03:15:14,251 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-09 03:15:14,251 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-09 03:15:14,251 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-09 03:15:14,252 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-09 03:15:14,252 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-09 03:15:14,253 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-09 03:15:14,253 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-09 03:15:14,254 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-09 03:15:14,254 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-09 03:15:14,255 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-09 03:15:14,255 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-09 03:15:14,255 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-09 03:15:14,255 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-09 03:15:14,256 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-09 03:15:14,256 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-09 03:15:14,257 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-09 03:15:14,258 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf
[2024-03-09 03:15:14,276 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-09 03:15:14,276 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 03:15:14,276 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 03:15:14,276 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 03:15:14,277 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 03:15:14,277 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 03:15:14,277 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 03:15:14,277 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 03:15:14,277 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-09 03:15:14,278 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 03:15:14,278 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 03:15:14,279 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 03:15:14,279 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:15:14,280 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 03:15:14,280 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 03:15:14,281 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 03:15:14,281 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2024-03-09 03:15:14,281 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-09 03:15:14,281 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4ebc1fb9eba41c231393a5884ecb89fb8b7e4768600ef8a85dd877844861ace
[2024-03-09 03:15:14,505 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 03:15:14,522 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 03:15:14,524 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 03:15:14,525 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-09 03:15:14,526 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-09 03:15:14,527 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-09 03:15:15,579 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 03:15:15,776 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-09 03:15:15,777 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-09 03:15:15,788 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/8c8407f08/956bf6df452342af9882574ff9fb1804/FLAGf12893692
[2024-03-09 03:15:15,803 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/8c8407f08/956bf6df452342af9882574ff9fb1804
[2024-03-09 03:15:15,805 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 03:15:15,806 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 03:15:15,807 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 03:15:15,807 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 03:15:15,809 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 03:15:15,810 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:15:15" (1/1) ...
[2024-03-09 03:15:15,811 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7e17f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:15, skipping insertion in model container
[2024-03-09 03:15:15,811 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:15:15" (1/1) ...
[2024-03-09 03:15:15,815 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-09 03:15:15,848 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-09 03:15:15,959 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:15:16,153 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-03-09 03:15:16,158 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:15:16,166 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-09 03:15:16,175 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:15:16,194 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2024-03-09 03:15:16,198 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:15:16,238 INFO  L208         MainTranslator]: Completed translation
[2024-03-09 03:15:16,238 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16 WrapperNode
[2024-03-09 03:15:16,238 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 03:15:16,239 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 03:15:16,239 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 03:15:16,239 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 03:15:16,244 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,262 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,281 INFO  L138                Inliner]: procedures = 279, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102
[2024-03-09 03:15:16,281 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 03:15:16,282 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 03:15:16,282 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 03:15:16,282 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 03:15:16,289 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,289 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,293 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,293 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,303 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,305 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,307 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,309 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,312 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 03:15:16,312 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 03:15:16,312 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 03:15:16,313 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-09 03:15:16,313 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (1/1) ...
[2024-03-09 03:15:16,318 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:15:16,333 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:15:16,345 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:16,350 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-09 03:15:16,378 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2024-03-09 03:15:16,378 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 03:15:16,378 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 03:15:16,378 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 03:15:16,379 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2024-03-09 03:15:16,379 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 03:15:16,379 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 03:15:16,379 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-09 03:15:16,379 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 03:15:16,379 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 03:15:16,380 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 03:15:16,380 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 03:15:16,381 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-09 03:15:16,519 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-09 03:15:16,521 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 03:15:16,782 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-09 03:15:16,788 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 03:15:16,788 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 03:15:16,790 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:15:16 BoogieIcfgContainer
[2024-03-09 03:15:16,791 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 03:15:16,792 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 03:15:16,792 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 03:15:16,794 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-09 03:15:16,794 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:15:15" (1/3) ...
[2024-03-09 03:15:16,795 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773d9665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:15:16, skipping insertion in model container
[2024-03-09 03:15:16,795 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:15:16" (2/3) ...
[2024-03-09 03:15:16,795 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773d9665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:15:16, skipping insertion in model container
[2024-03-09 03:15:16,795 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:15:16" (3/3) ...
[2024-03-09 03:15:16,796 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-03-09 03:15:16,802 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 03:15:16,809 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 03:15:16,809 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-09 03:15:16,809 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 03:15:16,857 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 03:15:16,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2024-03-09 03:15:16,941 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2024-03-09 03:15:16,941 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:15:16,945 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2024-03-09 03:15:16,945 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 147 transitions, 302 flow
[2024-03-09 03:15:16,949 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2024-03-09 03:15:16,951 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 03:15:16,959 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2024-03-09 03:15:16,961 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2024-03-09 03:15:16,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2024-03-09 03:15:16,990 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2024-03-09 03:15:16,991 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:15:16,991 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2024-03-09 03:15:16,993 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3744
[2024-03-09 03:15:20,999 INFO  L134        LiptonReduction]: Checked pairs total: 27730
[2024-03-09 03:15:20,999 INFO  L136        LiptonReduction]: Total number of compositions: 95
[2024-03-09 03:15:21,011 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 03:15:21,016 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@422f9b9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 03:15:21,016 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-09 03:15:21,017 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-09 03:15:21,017 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 03:15:21,017 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:21,018 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-09 03:15:21,018 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:21,021 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:21,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 474, now seen corresponding path program 1 times
[2024-03-09 03:15:21,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:21,030 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514794412]
[2024-03-09 03:15:21,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:21,030 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:21,031 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:21,055 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:21,063 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-03-09 03:15:21,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:21,326 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2024-03-09 03:15:21,329 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:21,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:21,332 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:21,332 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:21,332 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514794412]
[2024-03-09 03:15:21,333 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [514794412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:21,333 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:21,333 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-09 03:15:21,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278980053]
[2024-03-09 03:15:21,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:21,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-09 03:15:21,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:21,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-09 03:15:21,355 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-09 03:15:21,357 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 242
[2024-03-09 03:15:21,358 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,359 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:21,359 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 242
[2024-03-09 03:15:21,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:21,472 INFO  L130       PetriNetUnfolder]: 66/395 cut-off events.
[2024-03-09 03:15:21,473 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-09 03:15:21,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 566 conditions, 395 events. 66/395 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2190 event pairs, 65 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 495. Up to 165 conditions per place. 
[2024-03-09 03:15:21,476 INFO  L137   encePairwiseOnDemand]: 241/242 looper letters, 22 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2024-03-09 03:15:21,476 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 184 flow
[2024-03-09 03:15:21,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-09 03:15:21,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-09 03:15:21,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions.
[2024-03-09 03:15:21,486 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6301652892561983
[2024-03-09 03:15:21,486 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 305 transitions.
[2024-03-09 03:15:21,486 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions.
[2024-03-09 03:15:21,487 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:21,489 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions.
[2024-03-09 03:15:21,491 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,496 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,496 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,497 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 305 transitions.
[2024-03-09 03:15:21,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 184 flow
[2024-03-09 03:15:21,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:21,501 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2024-03-09 03:15:21,503 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-03-09 03:15:21,506 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2024-03-09 03:15:21,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2024-03-09 03:15:21,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,507 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:21,507 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2024-03-09 03:15:21,516 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2024-03-09 03:15:21,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:21,709 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:21,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:21,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 465820, now seen corresponding path program 1 times
[2024-03-09 03:15:21,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:21,712 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266307865]
[2024-03-09 03:15:21,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:21,713 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:21,713 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:21,715 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:21,722 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-03-09 03:15:21,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:21,787 INFO  L263         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-03-09 03:15:21,788 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:21,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:21,807 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:21,808 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:21,808 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266307865]
[2024-03-09 03:15:21,808 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266307865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:21,808 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:21,808 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:21,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559465116]
[2024-03-09 03:15:21,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:21,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:21,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:21,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:21,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:21,837 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 242
[2024-03-09 03:15:21,838 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,838 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:21,838 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 242
[2024-03-09 03:15:21,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:21,989 INFO  L130       PetriNetUnfolder]: 136/497 cut-off events.
[2024-03-09 03:15:21,989 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-09 03:15:21,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 830 conditions, 497 events. 136/497 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2588 event pairs, 66 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 826. Up to 169 conditions per place. 
[2024-03-09 03:15:21,992 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 45 selfloop transitions, 8 changer transitions 0/89 dead transitions.
[2024-03-09 03:15:21,992 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 292 flow
[2024-03-09 03:15:21,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:21,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:21,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions.
[2024-03-09 03:15:21,995 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6143250688705234
[2024-03-09 03:15:21,995 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 446 transitions.
[2024-03-09 03:15:21,995 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions.
[2024-03-09 03:15:21,996 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:21,996 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions.
[2024-03-09 03:15:21,997 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:21,999 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,000 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,000 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 446 transitions.
[2024-03-09 03:15:22,000 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 292 flow
[2024-03-09 03:15:22,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:22,002 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2024-03-09 03:15:22,002 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2024-03-09 03:15:22,003 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2024-03-09 03:15:22,003 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2024-03-09 03:15:22,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,004 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:22,004 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:22,014 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-03-09 03:15:22,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:22,206 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:22,207 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:22,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 822265531, now seen corresponding path program 1 times
[2024-03-09 03:15:22,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:22,209 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381097286]
[2024-03-09 03:15:22,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:22,209 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:22,209 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:22,211 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:22,217 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-03-09 03:15:22,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:22,265 INFO  L263         TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-03-09 03:15:22,266 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:22,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:22,274 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:22,275 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:22,275 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381097286]
[2024-03-09 03:15:22,275 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [381097286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:22,276 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:22,276 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:22,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015798742]
[2024-03-09 03:15:22,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:22,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:22,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:22,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:22,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:22,300 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2024-03-09 03:15:22,301 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,301 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:22,301 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2024-03-09 03:15:22,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:22,439 INFO  L130       PetriNetUnfolder]: 121/490 cut-off events.
[2024-03-09 03:15:22,439 INFO  L131       PetriNetUnfolder]: For 89/89 co-relation queries the response was YES.
[2024-03-09 03:15:22,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 944 conditions, 490 events. 121/490 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2624 event pairs, 93 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 938. Up to 264 conditions per place. 
[2024-03-09 03:15:22,442 INFO  L137   encePairwiseOnDemand]: 237/242 looper letters, 35 selfloop transitions, 6 changer transitions 0/83 dead transitions.
[2024-03-09 03:15:22,442 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 320 flow
[2024-03-09 03:15:22,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:22,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:22,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2024-03-09 03:15:22,445 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5895316804407713
[2024-03-09 03:15:22,445 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2024-03-09 03:15:22,445 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2024-03-09 03:15:22,445 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:22,445 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2024-03-09 03:15:22,446 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,448 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,449 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,449 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 3 states and 428 transitions.
[2024-03-09 03:15:22,449 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 320 flow
[2024-03-09 03:15:22,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:22,452 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 236 flow
[2024-03-09 03:15:22,452 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2024-03-09 03:15:22,453 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2024-03-09 03:15:22,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 236 flow
[2024-03-09 03:15:22,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,454 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:22,454 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:22,466 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-03-09 03:15:22,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:22,656 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:22,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:22,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 862667700, now seen corresponding path program 1 times
[2024-03-09 03:15:22,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:22,658 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653556275]
[2024-03-09 03:15:22,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:22,659 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:22,659 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:22,661 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:22,667 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-03-09 03:15:22,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:22,732 INFO  L263         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core
[2024-03-09 03:15:22,734 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:22,797 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:22,798 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:22,798 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:22,798 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653556275]
[2024-03-09 03:15:22,798 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653556275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:22,798 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:22,798 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 03:15:22,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834887454]
[2024-03-09 03:15:22,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:22,799 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 03:15:22,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:22,799 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 03:15:22,799 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 03:15:22,921 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 242
[2024-03-09 03:15:22,923 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 236 flow. Second operand  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:22,923 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:22,923 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 242
[2024-03-09 03:15:22,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:23,104 INFO  L130       PetriNetUnfolder]: 94/474 cut-off events.
[2024-03-09 03:15:23,104 INFO  L131       PetriNetUnfolder]: For 84/86 co-relation queries the response was YES.
[2024-03-09 03:15:23,105 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 867 conditions, 474 events. 94/474 cut-off events. For 84/86 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2540 event pairs, 56 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 860. Up to 191 conditions per place. 
[2024-03-09 03:15:23,106 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 38 selfloop transitions, 3 changer transitions 1/94 dead transitions.
[2024-03-09 03:15:23,106 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 361 flow
[2024-03-09 03:15:23,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 03:15:23,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 03:15:23,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions.
[2024-03-09 03:15:23,109 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5981404958677686
[2024-03-09 03:15:23,109 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 579 transitions.
[2024-03-09 03:15:23,109 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions.
[2024-03-09 03:15:23,110 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:23,110 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions.
[2024-03-09 03:15:23,113 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:23,116 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:23,116 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:23,117 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 236 flow. Second operand 4 states and 579 transitions.
[2024-03-09 03:15:23,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 361 flow
[2024-03-09 03:15:23,118 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 94 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 03:15:23,119 INFO  L231             Difference]: Finished difference. Result has 78 places, 79 transitions, 246 flow
[2024-03-09 03:15:23,120 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=78, PETRI_TRANSITIONS=79}
[2024-03-09 03:15:23,120 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 9 predicate places.
[2024-03-09 03:15:23,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 246 flow
[2024-03-09 03:15:23,121 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:23,121 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:23,121 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:23,135 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-03-09 03:15:23,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:23,325 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:23,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:23,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 984420718, now seen corresponding path program 1 times
[2024-03-09 03:15:23,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:23,327 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436897262]
[2024-03-09 03:15:23,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:23,328 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:23,328 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:23,330 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:23,334 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-03-09 03:15:23,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:23,386 INFO  L263         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core
[2024-03-09 03:15:23,389 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:23,415 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:15:23,429 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2024-03-09 03:15:23,482 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:23,482 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2024-03-09 03:15:23,524 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:23,525 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2024-03-09 03:15:23,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:23,556 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:23,556 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:23,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436897262]
[2024-03-09 03:15:23,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436897262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:23,557 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:23,557 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:15:23,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223256148]
[2024-03-09 03:15:23,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:23,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:15:23,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:23,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:15:23,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:15:23,877 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242
[2024-03-09 03:15:23,878 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 246 flow. Second operand  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:23,878 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:23,878 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242
[2024-03-09 03:15:23,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:24,188 INFO  L130       PetriNetUnfolder]: 385/1165 cut-off events.
[2024-03-09 03:15:24,188 INFO  L131       PetriNetUnfolder]: For 137/147 co-relation queries the response was YES.
[2024-03-09 03:15:24,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2359 conditions, 1165 events. 385/1165 cut-off events. For 137/147 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7676 event pairs, 121 based on Foata normal form. 9/1130 useless extension candidates. Maximal degree in co-relation 2350. Up to 498 conditions per place. 
[2024-03-09 03:15:24,195 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 84 selfloop transitions, 29 changer transitions 0/144 dead transitions.
[2024-03-09 03:15:24,195 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 144 transitions, 620 flow
[2024-03-09 03:15:24,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:15:24,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:15:24,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions.
[2024-03-09 03:15:24,198 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5557851239669421
[2024-03-09 03:15:24,198 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 807 transitions.
[2024-03-09 03:15:24,198 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 807 transitions.
[2024-03-09 03:15:24,198 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:24,198 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 807 transitions.
[2024-03-09 03:15:24,210 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,212 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,213 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,213 INFO  L175             Difference]: Start difference. First operand has 78 places, 79 transitions, 246 flow. Second operand 6 states and 807 transitions.
[2024-03-09 03:15:24,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 144 transitions, 620 flow
[2024-03-09 03:15:24,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 144 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 03:15:24,217 INFO  L231             Difference]: Finished difference. Result has 87 places, 108 transitions, 464 flow
[2024-03-09 03:15:24,217 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=87, PETRI_TRANSITIONS=108}
[2024-03-09 03:15:24,218 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 18 predicate places.
[2024-03-09 03:15:24,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 464 flow
[2024-03-09 03:15:24,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,219 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:24,219 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:24,227 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-03-09 03:15:24,427 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:24,427 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:24,428 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:24,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 1135620919, now seen corresponding path program 1 times
[2024-03-09 03:15:24,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:24,429 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521785524]
[2024-03-09 03:15:24,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:24,430 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:24,430 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:24,432 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:24,433 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-03-09 03:15:24,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:24,505 INFO  L263         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-03-09 03:15:24,507 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:24,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:24,518 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:24,518 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:24,518 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521785524]
[2024-03-09 03:15:24,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521785524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:24,519 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:24,519 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:24,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392891962]
[2024-03-09 03:15:24,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:24,519 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:24,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:24,520 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:24,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:24,530 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 242
[2024-03-09 03:15:24,530 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 108 transitions, 464 flow. Second operand  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,531 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:24,531 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 242
[2024-03-09 03:15:24,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:24,658 INFO  L130       PetriNetUnfolder]: 200/819 cut-off events.
[2024-03-09 03:15:24,658 INFO  L131       PetriNetUnfolder]: For 255/274 co-relation queries the response was YES.
[2024-03-09 03:15:24,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 819 events. 200/819 cut-off events. For 255/274 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5444 event pairs, 26 based on Foata normal form. 26/821 useless extension candidates. Maximal degree in co-relation 1885. Up to 290 conditions per place. 
[2024-03-09 03:15:24,663 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 40 selfloop transitions, 2 changer transitions 1/119 dead transitions.
[2024-03-09 03:15:24,663 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 119 transitions, 588 flow
[2024-03-09 03:15:24,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:24,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:24,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions.
[2024-03-09 03:15:24,664 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6060606060606061
[2024-03-09 03:15:24,664 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 440 transitions.
[2024-03-09 03:15:24,664 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions.
[2024-03-09 03:15:24,665 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:24,665 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions.
[2024-03-09 03:15:24,666 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,667 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,667 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,667 INFO  L175             Difference]: Start difference. First operand has 87 places, 108 transitions, 464 flow. Second operand 3 states and 440 transitions.
[2024-03-09 03:15:24,667 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 119 transitions, 588 flow
[2024-03-09 03:15:24,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:24,674 INFO  L231             Difference]: Finished difference. Result has 88 places, 107 transitions, 468 flow
[2024-03-09 03:15:24,674 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=88, PETRI_TRANSITIONS=107}
[2024-03-09 03:15:24,675 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2024-03-09 03:15:24,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 468 flow
[2024-03-09 03:15:24,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:24,675 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:24,675 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:24,689 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2024-03-09 03:15:24,886 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:24,887 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:24,888 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:24,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 869317897, now seen corresponding path program 1 times
[2024-03-09 03:15:24,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:24,889 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789224039]
[2024-03-09 03:15:24,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:24,890 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:24,890 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:24,892 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:24,894 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-03-09 03:15:24,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:24,994 INFO  L263         TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core
[2024-03-09 03:15:24,998 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:25,007 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-03-09 03:15:25,025 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-03-09 03:15:25,060 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:25,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-03-09 03:15:25,116 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:25,116 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-03-09 03:15:25,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:25,200 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:25,200 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:25,201 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789224039]
[2024-03-09 03:15:25,201 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789224039] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:25,201 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:25,201 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:15:25,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288333787]
[2024-03-09 03:15:25,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:25,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:15:25,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:25,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:15:25,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:15:25,418 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2024-03-09 03:15:25,419 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 468 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:25,419 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:25,419 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2024-03-09 03:15:25,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:26,267 INFO  L130       PetriNetUnfolder]: 524/1421 cut-off events.
[2024-03-09 03:15:26,267 INFO  L131       PetriNetUnfolder]: For 579/596 co-relation queries the response was YES.
[2024-03-09 03:15:26,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 1421 events. 524/1421 cut-off events. For 579/596 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9547 event pairs, 187 based on Foata normal form. 10/1347 useless extension candidates. Maximal degree in co-relation 3831. Up to 940 conditions per place. 
[2024-03-09 03:15:26,276 INFO  L137   encePairwiseOnDemand]: 220/242 looper letters, 130 selfloop transitions, 73 changer transitions 0/234 dead transitions.
[2024-03-09 03:15:26,276 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 234 transitions, 1370 flow
[2024-03-09 03:15:26,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:15:26,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:15:26,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions.
[2024-03-09 03:15:26,279 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5840220385674931
[2024-03-09 03:15:26,279 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 848 transitions.
[2024-03-09 03:15:26,279 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions.
[2024-03-09 03:15:26,280 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:26,280 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions.
[2024-03-09 03:15:26,282 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:26,283 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:26,284 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:26,284 INFO  L175             Difference]: Start difference. First operand has 88 places, 107 transitions, 468 flow. Second operand 6 states and 848 transitions.
[2024-03-09 03:15:26,284 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 234 transitions, 1370 flow
[2024-03-09 03:15:26,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 234 transitions, 1354 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:26,291 INFO  L231             Difference]: Finished difference. Result has 94 places, 178 transitions, 1017 flow
[2024-03-09 03:15:26,291 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1017, PETRI_PLACES=94, PETRI_TRANSITIONS=178}
[2024-03-09 03:15:26,292 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 25 predicate places.
[2024-03-09 03:15:26,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 178 transitions, 1017 flow
[2024-03-09 03:15:26,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:26,293 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:26,293 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:26,307 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0
[2024-03-09 03:15:26,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:26,494 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:26,495 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:26,495 INFO  L85        PathProgramCache]: Analyzing trace with hash 2012274832, now seen corresponding path program 1 times
[2024-03-09 03:15:26,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:26,496 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986906315]
[2024-03-09 03:15:26,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:26,496 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:26,496 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:26,498 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:26,499 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-03-09 03:15:26,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:26,615 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2024-03-09 03:15:26,620 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:26,843 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:15:26,873 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2024-03-09 03:15:26,933 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:26,934 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2024-03-09 03:15:26,996 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:26,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2024-03-09 03:15:27,084 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:15:27,086 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:15:27,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:15:27,154 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:27,155 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:27,155 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986906315]
[2024-03-09 03:15:27,155 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [986906315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:27,156 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:27,156 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-09 03:15:27,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598680591]
[2024-03-09 03:15:27,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:27,157 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 03:15:27,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:27,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 03:15:27,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-09 03:15:29,283 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2024-03-09 03:15:29,286 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 178 transitions, 1017 flow. Second operand  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:29,286 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:29,286 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2024-03-09 03:15:29,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:30,473 INFO  L130       PetriNetUnfolder]: 471/1298 cut-off events.
[2024-03-09 03:15:30,473 INFO  L131       PetriNetUnfolder]: For 896/918 co-relation queries the response was YES.
[2024-03-09 03:15:30,478 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1298 events. 471/1298 cut-off events. For 896/918 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8600 event pairs, 211 based on Foata normal form. 43/1286 useless extension candidates. Maximal degree in co-relation 4225. Up to 958 conditions per place. 
[2024-03-09 03:15:30,485 INFO  L137   encePairwiseOnDemand]: 233/242 looper letters, 144 selfloop transitions, 7 changer transitions 1/197 dead transitions.
[2024-03-09 03:15:30,485 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 197 transitions, 1416 flow
[2024-03-09 03:15:30,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 03:15:30,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 03:15:30,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions.
[2024-03-09 03:15:30,488 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5076741440377804
[2024-03-09 03:15:30,488 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 860 transitions.
[2024-03-09 03:15:30,489 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions.
[2024-03-09 03:15:30,489 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:30,489 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions.
[2024-03-09 03:15:30,491 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:30,492 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:30,493 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:30,493 INFO  L175             Difference]: Start difference. First operand has 94 places, 178 transitions, 1017 flow. Second operand 7 states and 860 transitions.
[2024-03-09 03:15:30,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 197 transitions, 1416 flow
[2024-03-09 03:15:30,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 197 transitions, 1344 flow, removed 36 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:30,504 INFO  L231             Difference]: Finished difference. Result has 101 places, 179 transitions, 989 flow
[2024-03-09 03:15:30,504 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=989, PETRI_PLACES=101, PETRI_TRANSITIONS=179}
[2024-03-09 03:15:30,505 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 32 predicate places.
[2024-03-09 03:15:30,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 179 transitions, 989 flow
[2024-03-09 03:15:30,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:30,506 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:30,506 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:30,521 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2024-03-09 03:15:30,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:30,707 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:30,708 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:30,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 48856483, now seen corresponding path program 1 times
[2024-03-09 03:15:30,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:30,709 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802863656]
[2024-03-09 03:15:30,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:30,710 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:30,710 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:30,712 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:30,714 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-03-09 03:15:30,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:30,863 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2024-03-09 03:15:30,869 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:31,073 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-03-09 03:15:31,111 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-03-09 03:15:31,179 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:31,179 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-03-09 03:15:31,277 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:31,277 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-03-09 03:15:31,404 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:15:31,405 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58
[2024-03-09 03:15:31,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:15:31,518 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:31,518 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:31,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802863656]
[2024-03-09 03:15:31,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [802863656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:31,519 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:31,519 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-09 03:15:31,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062486237]
[2024-03-09 03:15:31,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:31,520 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 03:15:31,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:31,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 03:15:31,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-09 03:15:33,966 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2024-03-09 03:15:33,968 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 179 transitions, 989 flow. Second operand  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:33,968 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:33,968 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2024-03-09 03:15:33,969 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:36,507 INFO  L130       PetriNetUnfolder]: 497/1329 cut-off events.
[2024-03-09 03:15:36,507 INFO  L131       PetriNetUnfolder]: For 979/994 co-relation queries the response was YES.
[2024-03-09 03:15:36,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 1329 events. 497/1329 cut-off events. For 979/994 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8664 event pairs, 177 based on Foata normal form. 14/1279 useless extension candidates. Maximal degree in co-relation 4402. Up to 631 conditions per place. 
[2024-03-09 03:15:36,516 INFO  L137   encePairwiseOnDemand]: 230/242 looper letters, 248 selfloop transitions, 57 changer transitions 1/334 dead transitions.
[2024-03-09 03:15:36,517 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 334 transitions, 2411 flow
[2024-03-09 03:15:36,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 03:15:36,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 03:15:36,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1064 transitions.
[2024-03-09 03:15:36,520 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5495867768595041
[2024-03-09 03:15:36,520 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1064 transitions.
[2024-03-09 03:15:36,520 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1064 transitions.
[2024-03-09 03:15:36,521 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:36,521 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1064 transitions.
[2024-03-09 03:15:36,522 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:36,524 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:36,525 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:36,525 INFO  L175             Difference]: Start difference. First operand has 101 places, 179 transitions, 989 flow. Second operand 8 states and 1064 transitions.
[2024-03-09 03:15:36,525 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 334 transitions, 2411 flow
[2024-03-09 03:15:36,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 334 transitions, 2387 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-03-09 03:15:36,536 INFO  L231             Difference]: Finished difference. Result has 111 places, 204 transitions, 1342 flow
[2024-03-09 03:15:36,536 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1342, PETRI_PLACES=111, PETRI_TRANSITIONS=204}
[2024-03-09 03:15:36,537 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 42 predicate places.
[2024-03-09 03:15:36,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 204 transitions, 1342 flow
[2024-03-09 03:15:36,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:36,538 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:36,538 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:36,547 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0
[2024-03-09 03:15:36,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:36,743 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:36,743 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:36,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -987204886, now seen corresponding path program 1 times
[2024-03-09 03:15:36,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:36,744 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318293056]
[2024-03-09 03:15:36,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:36,745 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:36,746 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:36,747 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:36,749 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-03-09 03:15:36,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:36,837 INFO  L263         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-03-09 03:15:36,839 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:36,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:15:36,848 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:36,849 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:36,849 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318293056]
[2024-03-09 03:15:36,849 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [318293056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:36,849 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:36,850 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 03:15:36,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359256541]
[2024-03-09 03:15:36,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:36,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 03:15:36,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:36,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 03:15:36,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 03:15:36,883 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 242
[2024-03-09 03:15:36,884 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 204 transitions, 1342 flow. Second operand  has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:36,884 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:36,884 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 242
[2024-03-09 03:15:36,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:37,091 INFO  L130       PetriNetUnfolder]: 355/1085 cut-off events.
[2024-03-09 03:15:37,091 INFO  L131       PetriNetUnfolder]: For 1630/1649 co-relation queries the response was YES.
[2024-03-09 03:15:37,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1085 events. 355/1085 cut-off events. For 1630/1649 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7105 event pairs, 99 based on Foata normal form. 8/1044 useless extension candidates. Maximal degree in co-relation 3867. Up to 388 conditions per place. 
[2024-03-09 03:15:37,098 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 46 selfloop transitions, 10 changer transitions 25/223 dead transitions.
[2024-03-09 03:15:37,098 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 223 transitions, 1563 flow
[2024-03-09 03:15:37,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 03:15:37,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 03:15:37,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions.
[2024-03-09 03:15:37,100 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6033057851239669
[2024-03-09 03:15:37,100 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 438 transitions.
[2024-03-09 03:15:37,100 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions.
[2024-03-09 03:15:37,101 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:37,101 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions.
[2024-03-09 03:15:37,102 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:37,103 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:37,103 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:37,103 INFO  L175             Difference]: Start difference. First operand has 111 places, 204 transitions, 1342 flow. Second operand 3 states and 438 transitions.
[2024-03-09 03:15:37,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 223 transitions, 1563 flow
[2024-03-09 03:15:37,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 223 transitions, 1563 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:15:37,114 INFO  L231             Difference]: Finished difference. Result has 114 places, 191 transitions, 1273 flow
[2024-03-09 03:15:37,114 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1273, PETRI_PLACES=114, PETRI_TRANSITIONS=191}
[2024-03-09 03:15:37,115 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 45 predicate places.
[2024-03-09 03:15:37,115 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 191 transitions, 1273 flow
[2024-03-09 03:15:37,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:37,115 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:37,116 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:37,131 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-03-09 03:15:37,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:37,317 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:37,318 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:37,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 590350958, now seen corresponding path program 1 times
[2024-03-09 03:15:37,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:37,319 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688128262]
[2024-03-09 03:15:37,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:37,320 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:37,320 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:37,322 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:37,324 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-03-09 03:15:37,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:15:37,424 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core
[2024-03-09 03:15:37,428 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:15:37,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:15:37,459 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29
[2024-03-09 03:15:37,490 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:37,491 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46
[2024-03-09 03:15:37,541 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:15:37,541 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63
[2024-03-09 03:15:37,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 03:15:37,607 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 03:15:37,607 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-03-09 03:15:37,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688128262]
[2024-03-09 03:15:37,608 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688128262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:15:37,609 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:15:37,609 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:15:37,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454578385]
[2024-03-09 03:15:37,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:15:37,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:15:37,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-03-09 03:15:37,611 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:15:37,611 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:15:38,103 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 242
[2024-03-09 03:15:38,105 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 191 transitions, 1273 flow. Second operand  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:38,105 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:15:38,105 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 242
[2024-03-09 03:15:38,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:15:38,813 INFO  L130       PetriNetUnfolder]: 435/1219 cut-off events.
[2024-03-09 03:15:38,814 INFO  L131       PetriNetUnfolder]: For 2869/2933 co-relation queries the response was YES.
[2024-03-09 03:15:38,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 1219 events. 435/1219 cut-off events. For 2869/2933 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7801 event pairs, 128 based on Foata normal form. 23/1205 useless extension candidates. Maximal degree in co-relation 4815. Up to 687 conditions per place. 
[2024-03-09 03:15:38,825 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 85 selfloop transitions, 41 changer transitions 21/246 dead transitions.
[2024-03-09 03:15:38,825 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 246 transitions, 1952 flow
[2024-03-09 03:15:38,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:15:38,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:15:38,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions.
[2024-03-09 03:15:38,829 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5723140495867769
[2024-03-09 03:15:38,829 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 831 transitions.
[2024-03-09 03:15:38,829 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions.
[2024-03-09 03:15:38,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:15:38,830 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions.
[2024-03-09 03:15:38,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:38,834 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:38,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:38,835 INFO  L175             Difference]: Start difference. First operand has 114 places, 191 transitions, 1273 flow. Second operand 6 states and 831 transitions.
[2024-03-09 03:15:38,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 246 transitions, 1952 flow
[2024-03-09 03:15:38,846 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 246 transitions, 1903 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-03-09 03:15:38,849 INFO  L231             Difference]: Finished difference. Result has 119 places, 217 transitions, 1669 flow
[2024-03-09 03:15:38,849 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1669, PETRI_PLACES=119, PETRI_TRANSITIONS=217}
[2024-03-09 03:15:38,849 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 50 predicate places.
[2024-03-09 03:15:38,850 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 217 transitions, 1669 flow
[2024-03-09 03:15:38,850 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:15:38,850 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:15:38,850 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:38,868 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0
[2024-03-09 03:15:39,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:39,051 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-09 03:15:39,052 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:15:39,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -685461694, now seen corresponding path program 1 times
[2024-03-09 03:15:39,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-03-09 03:15:39,053 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581692139]
[2024-03-09 03:15:39,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:15:39,054 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:39,054 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2024-03-09 03:15:39,056 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-03-09 03:15:39,058 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-03-09 03:15:39,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:15:39,146 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 03:15:39,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:15:39,235 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-03-09 03:15:39,236 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 03:15:39,236 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2024-03-09 03:15:39,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-09 03:15:39,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-09 03:15:39,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-09 03:15:39,238 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-09 03:15:39,239 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-09 03:15:39,239 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-09 03:15:39,239 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-09 03:15:39,239 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-09 03:15:39,239 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2024-03-09 03:15:39,239 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-09 03:15:39,240 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-09 03:15:39,240 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-09 03:15:39,240 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-09 03:15:39,240 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-09 03:15:39,240 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-09 03:15:39,240 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-09 03:15:39,241 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-09 03:15:39,250 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2024-03-09 03:15:39,450 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-03-09 03:15:39,451 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:15:39,461 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-03-09 03:15:39,461 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2024-03-09 03:15:39,490 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 03:15:39 BasicIcfg
[2024-03-09 03:15:39,490 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-03-09 03:15:39,491 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-03-09 03:15:39,491 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2024-03-09 03:15:39,491 INFO  L275        PluginConnector]: Witness Printer initialized
[2024-03-09 03:15:39,491 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:15:16" (3/4) ...
[2024-03-09 03:15:39,493 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2024-03-09 03:15:39,493 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-03-09 03:15:39,494 INFO  L158              Benchmark]: Toolchain (without parser) took 23687.53ms. Allocated memory was 65.0MB in the beginning and 184.5MB in the end (delta: 119.5MB). Free memory was 40.7MB in the beginning and 117.5MB in the end (delta: -76.8MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB.
[2024-03-09 03:15:39,494 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 03:15:39,494 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 431.76ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.6MB in the beginning and 50.7MB in the end (delta: -10.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB.
[2024-03-09 03:15:39,494 INFO  L158              Benchmark]: Boogie Procedure Inliner took 42.15ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 47.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 03:15:39,495 INFO  L158              Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 90.2MB. Free memory was 47.8MB in the beginning and 45.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-03-09 03:15:39,495 INFO  L158              Benchmark]: RCFGBuilder took 478.31ms. Allocated memory is still 90.2MB. Free memory was 45.4MB in the beginning and 47.5MB in the end (delta: -2.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB.
[2024-03-09 03:15:39,495 INFO  L158              Benchmark]: TraceAbstraction took 22698.07ms. Allocated memory was 90.2MB in the beginning and 184.5MB in the end (delta: 94.4MB). Free memory was 46.9MB in the beginning and 117.5MB in the end (delta: -70.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB.
[2024-03-09 03:15:39,495 INFO  L158              Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 184.5MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-03-09 03:15:39,497 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.12ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 431.76ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 40.6MB in the beginning and 50.7MB in the end (delta: -10.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 42.15ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 47.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 30.04ms. Allocated memory is still 90.2MB. Free memory was 47.8MB in the beginning and 45.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 478.31ms. Allocated memory is still 90.2MB. Free memory was 45.4MB in the beginning and 47.5MB in the end (delta: -2.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 22698.07ms. Allocated memory was 90.2MB in the beginning and 184.5MB in the end (delta: 94.4MB). Free memory was 46.9MB in the beginning and 117.5MB in the end (delta: -70.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB.
 * Witness Printer took 2.64ms. Allocated memory is still 184.5MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.0s, 145 PlacesBefore, 69 PlacesAfterwards, 147 TransitionsBefore, 67 TransitionsAfterwards, 3744 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 95 TotalNumberOfCompositions, 27730 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8432, independent: 7452, independent conditional: 0, independent unconditional: 7452, dependent: 980, dependent conditional: 0, dependent unconditional: 980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1709, independent: 1627, independent conditional: 0, independent unconditional: 1627, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8432, independent: 5825, independent conditional: 0, independent unconditional: 5825, dependent: 898, dependent conditional: 0, dependent unconditional: 898, unknown: 1709, unknown conditional: 0, unknown unconditional: 1709] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 423, Positive conditional cache size: 0, Positive unconditional cache size: 423, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1051]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1036]               0  int threads_mask = -1;
[L1037]               0  int *datas;
[L1045]               0  int threads_total = __VERIFIER_nondet_int();
[L1046]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1033]  COND FALSE   0  !(!cond)
[L1046]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1047]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1033]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total < 32)
[L1048]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1048]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  datas = malloc(threads_total * sizeof(int))
[L1050]               0  int i = 0;
         VAL             [datas={2:0}, i=0, threads_mask=-1, threads_total=3, tids={15:0}]
[L1050]  COND TRUE    0  i < threads_total
[L1051]  EXPR         0  ffs(threads_mask)
[L1051]               0  int j = ffs(threads_mask) - 1;
[L1052]               0  threads_mask &= ~(1 << j)
         VAL             [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=3, tids={15:0}]
[L1053]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={6:0}, datas={2:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=0, threads_mask=-2, threads_total=3, tids={15:0}]
[L1053]  EXPR         0  tids[i]
         VAL             [\read(*tids)={6:0}, datas={2:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=0, threads_mask=-2, threads_total=3, tids={15:0}]
[L1053]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
         VAL             [\read(*tids)={6:0}, arg={0:0}, datas={2:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=0, threads_mask=-2, threads_total=3, tids={15:0}]
[L1050]               0  i++
         VAL             [arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=3, tids={15:0}]
[L1050]  COND TRUE    0  i < threads_total
[L1039]               1  int j = (int)arg;
[L1040]  EXPR         1  datas[j]
         VAL             [arg={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2]
[L1040]               1  datas[j] = __VERIFIER_nondet_int()
[L1041]               1  threads_mask |= 1 << j
         VAL             [arg={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-1, threads_mask |= 1 << j=-1]
[L1051]               0  ffs(threads_mask)
         VAL             [arg={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, j=0, threads_mask=-1, threads_mask |= 1 << j=-1, threads_total=3, tids={15:0}]

Now there is a data race on ~threads_mask~0 between 
	C: threads_mask |= 1 << j [1041]
and
	C: ffs(threads_mask) [1051]

  - UnprovableResult [Line: 1049]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1056]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1058]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1056]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1040]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1040]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 170 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 796 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2562 IncrementalHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 373 mSolverCounterUnsat, 19 mSDtfsCounter, 2562 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1669occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 54 QuantifiedInterpolants, 1227 SizeOfPredicates, 9 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-03-09 03:15:39,534 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
