./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP --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 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:54:11,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:54:11,548 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 22:54:11,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:54:11,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:54:11,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:54:11,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:54:11,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:54:11,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:54:11,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:54:11,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:54:11,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:54:11,613 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:54:11,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:54:11,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:54:11,616 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:54:11,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:54:11,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:54:11,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:54:11,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:54:11,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:54:11,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:54:11,619 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 22:54:11,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:54:11,620 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:54:11,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:54:11,621 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:54:11,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:54:11,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:54:11,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:54:11,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:54:11,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:54:11,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:54:11,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:54:11,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:54:11,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:54:11,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:54:11,626 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:54:11,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:54:11,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:54:11,627 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:54:11,627 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP 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 -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2023-11-06 22:54:11,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:54:11,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:54:11,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:54:11,952 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:54:11,953 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:54:11,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2023-11-06 22:54:15,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:54:15,477 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:54:15,477 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2023-11-06 22:54:15,493 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/data/82cade51d/444b2fcfd4fd4c15b0a592bf8fae35eb/FLAGbcc26dd48 [2023-11-06 22:54:15,517 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/data/82cade51d/444b2fcfd4fd4c15b0a592bf8fae35eb [2023-11-06 22:54:15,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:54:15,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:54:15,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:54:15,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:54:15,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:54:15,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:54:15" (1/1) ... [2023-11-06 22:54:15,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4f732a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:15, skipping insertion in model container [2023-11-06 22:54:15,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:54:15" (1/1) ... [2023-11-06 22:54:15,615 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:54:16,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:54:16,126 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:54:16,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:54:16,213 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:54:16,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16 WrapperNode [2023-11-06 22:54:16,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:54:16,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:54:16,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:54:16,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:54:16,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,306 INFO L138 Inliner]: procedures = 171, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 115 [2023-11-06 22:54:16,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:54:16,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:54:16,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:54:16,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:54:16,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:54:16,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:54:16,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:54:16,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:54:16,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (1/1) ... [2023-11-06 22:54:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:54:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:54:16,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:54:16,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:54:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-06 22:54:16,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-06 22:54:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 22:54:16,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 22:54:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:54:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:54:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:54:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:54:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:54:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:54:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:54:16,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:54:16,468 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:54:16,640 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:54:16,643 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:54:16,889 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:54:16,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:54:16,899 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:54:16,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:16 BoogieIcfgContainer [2023-11-06 22:54:16,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:54:16,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:54:16,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:54:16,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:54:16,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:54:15" (1/3) ... [2023-11-06 22:54:16,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca9ea18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:54:16, skipping insertion in model container [2023-11-06 22:54:16,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:16" (2/3) ... [2023-11-06 22:54:16,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca9ea18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:54:16, skipping insertion in model container [2023-11-06 22:54:16,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:16" (3/3) ... [2023-11-06 22:54:16,918 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2023-11-06 22:54:16,928 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:54:16,942 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:54:16,942 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-06 22:54:16,943 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:54:17,034 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:54:17,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 143 transitions, 294 flow [2023-11-06 22:54:17,168 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2023-11-06 22:54:17,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:54:17,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 161 events. 8/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-06 22:54:17,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 143 transitions, 294 flow [2023-11-06 22:54:17,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 142 transitions, 291 flow [2023-11-06 22:54:17,187 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:54:17,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 142 transitions, 291 flow [2023-11-06 22:54:17,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 142 transitions, 291 flow [2023-11-06 22:54:17,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 142 transitions, 291 flow [2023-11-06 22:54:17,267 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2023-11-06 22:54:17,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:54:17,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 161 events. 8/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-06 22:54:17,274 INFO L119 LiptonReduction]: Number of co-enabled transitions 4284 [2023-11-06 22:54:24,871 INFO L134 LiptonReduction]: Checked pairs total: 12472 [2023-11-06 22:54:24,871 INFO L136 LiptonReduction]: Total number of compositions: 159 [2023-11-06 22:54:24,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:54:24,897 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;@1baf0bb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:54:24,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-06 22:54:24,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:54:24,899 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:54:24,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:54:24,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:24,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:54:24,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-06 22:54:24,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2023-11-06 22:54:24,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874493624] [2023-11-06 22:54:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:24,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874493624] [2023-11-06 22:54:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874493624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:54:25,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449426567] [2023-11-06 22:54:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:25,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:54:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:54:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:54:25,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 302 [2023-11-06 22:54:25,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 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) [2023-11-06 22:54:25,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:25,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 302 [2023-11-06 22:54:25,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:25,223 INFO L124 PetriNetUnfolderBase]: 111/287 cut-off events. [2023-11-06 22:54:25,224 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:54:25,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 287 events. 111/287 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1510 event pairs, 99 based on Foata normal form. 49/279 useless extension candidates. Maximal degree in co-relation 485. Up to 197 conditions per place. [2023-11-06 22:54:25,234 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 15 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-11-06 22:54:25,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 93 flow [2023-11-06 22:54:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:54:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:54:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-11-06 22:54:25,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817880794701987 [2023-11-06 22:54:25,254 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-11-06 22:54:25,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-11-06 22:54:25,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:25,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-11-06 22:54:25,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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) [2023-11-06 22:54:25,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 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) [2023-11-06 22:54:25,273 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 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) [2023-11-06 22:54:25,275 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 75 flow. Second operand 2 states and 291 transitions. [2023-11-06 22:54:25,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 93 flow [2023-11-06 22:54:25,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 92 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:54:25,282 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 62 flow [2023-11-06 22:54:25,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-11-06 22:54:25,289 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2023-11-06 22:54:25,290 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 62 flow [2023-11-06 22:54:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 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) [2023-11-06 22:54:25,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:25,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:54:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:54:25,292 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-06 22:54:25,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 17202531, now seen corresponding path program 1 times [2023-11-06 22:54:25,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:25,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003587592] [2023-11-06 22:54:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003587592] [2023-11-06 22:54:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003587592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:25,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:54:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710961859] [2023-11-06 22:54:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:54:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:54:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:54:25,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 302 [2023-11-06 22:54:25,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-11-06 22:54:25,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:25,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 302 [2023-11-06 22:54:25,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:25,662 INFO L124 PetriNetUnfolderBase]: 240/494 cut-off events. [2023-11-06 22:54:25,662 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:54:25,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 494 events. 240/494 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2610 event pairs, 82 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 925. Up to 330 conditions per place. [2023-11-06 22:54:25,667 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 25 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-11-06 22:54:25,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 141 flow [2023-11-06 22:54:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:54:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:54:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-11-06 22:54:25,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45474613686534215 [2023-11-06 22:54:25,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-11-06 22:54:25,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-11-06 22:54:25,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:25,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-11-06 22:54:25,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2023-11-06 22:54:25,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 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) [2023-11-06 22:54:25,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 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) [2023-11-06 22:54:25,680 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 62 flow. Second operand 3 states and 412 transitions. [2023-11-06 22:54:25,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 141 flow [2023-11-06 22:54:25,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 141 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:54:25,682 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 90 flow [2023-11-06 22:54:25,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-11-06 22:54:25,683 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2023-11-06 22:54:25,683 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 90 flow [2023-11-06 22:54:25,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-11-06 22:54:25,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:25,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:54:25,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:54:25,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-06 22:54:25,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash 533356279, now seen corresponding path program 1 times [2023-11-06 22:54:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657723721] [2023-11-06 22:54:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657723721] [2023-11-06 22:54:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657723721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:54:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087176621] [2023-11-06 22:54:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:25,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:54:25,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:25,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:54:25,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:54:25,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 302 [2023-11-06 22:54:25,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-11-06 22:54:25,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:25,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 302 [2023-11-06 22:54:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:25,873 INFO L124 PetriNetUnfolderBase]: 326/643 cut-off events. [2023-11-06 22:54:25,874 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-06 22:54:25,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 643 events. 326/643 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3072 event pairs, 271 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 1389. Up to 547 conditions per place. [2023-11-06 22:54:25,880 INFO L140 encePairwiseOnDemand]: 298/302 looper letters, 19 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-11-06 22:54:25,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 124 flow [2023-11-06 22:54:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:54:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:54:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-11-06 22:54:25,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41721854304635764 [2023-11-06 22:54:25,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-11-06 22:54:25,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-11-06 22:54:25,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:25,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-11-06 22:54:25,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2023-11-06 22:54:25,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 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) [2023-11-06 22:54:25,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 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) [2023-11-06 22:54:25,893 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 90 flow. Second operand 3 states and 378 transitions. [2023-11-06 22:54:25,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 124 flow [2023-11-06 22:54:25,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:54:25,897 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 78 flow [2023-11-06 22:54:25,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-11-06 22:54:25,898 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2023-11-06 22:54:25,899 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 78 flow [2023-11-06 22:54:25,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-11-06 22:54:25,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:25,900 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:25,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:54:25,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-06 22:54:25,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1157327751, now seen corresponding path program 1 times [2023-11-06 22:54:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993956014] [2023-11-06 22:54:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:54:25,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:54:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:54:25,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:54:25,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:54:25,983 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-06 22:54:25,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2023-11-06 22:54:25,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2023-11-06 22:54:25,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2023-11-06 22:54:25,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2023-11-06 22:54:25,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2023-11-06 22:54:25,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2023-11-06 22:54:25,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2023-11-06 22:54:25,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2023-11-06 22:54:25,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2023-11-06 22:54:25,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2023-11-06 22:54:25,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2023-11-06 22:54:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2023-11-06 22:54:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2023-11-06 22:54:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2023-11-06 22:54:25,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2023-11-06 22:54:25,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2023-11-06 22:54:25,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:54:25,995 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:54:25,998 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:54:26,000 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 22:54:26,040 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:54:26,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 199 transitions, 418 flow [2023-11-06 22:54:26,079 INFO L124 PetriNetUnfolderBase]: 11/218 cut-off events. [2023-11-06 22:54:26,079 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:54:26,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 218 events. 11/218 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 421 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 225. Up to 6 conditions per place. [2023-11-06 22:54:26,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 199 transitions, 418 flow [2023-11-06 22:54:26,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 175 transitions, 363 flow [2023-11-06 22:54:26,084 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:54:26,085 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 175 transitions, 363 flow [2023-11-06 22:54:26,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 175 transitions, 363 flow [2023-11-06 22:54:26,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 175 transitions, 363 flow [2023-11-06 22:54:26,116 INFO L124 PetriNetUnfolderBase]: 11/218 cut-off events. [2023-11-06 22:54:26,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:54:26,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 218 events. 11/218 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 421 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 164. Up to 6 conditions per place. [2023-11-06 22:54:26,126 INFO L119 LiptonReduction]: Number of co-enabled transitions 9448 [2023-11-06 22:54:31,084 INFO L134 LiptonReduction]: Checked pairs total: 36719 [2023-11-06 22:54:31,084 INFO L136 LiptonReduction]: Total number of compositions: 177 [2023-11-06 22:54:31,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:54:31,088 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;@1baf0bb7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:54:31,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-06 22:54:31,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:54:31,089 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:54:31,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:54:31,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:31,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:54:31,090 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-06 22:54:31,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 981, now seen corresponding path program 1 times [2023-11-06 22:54:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076549754] [2023-11-06 22:54:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076549754] [2023-11-06 22:54:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076549754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:54:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442838767] [2023-11-06 22:54:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:31,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:54:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:54:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:54:31,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 376 [2023-11-06 22:54:31,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 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) [2023-11-06 22:54:31,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:31,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 376 [2023-11-06 22:54:31,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:31,524 INFO L124 PetriNetUnfolderBase]: 1570/3079 cut-off events. [2023-11-06 22:54:31,524 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-06 22:54:31,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5410 conditions, 3079 events. 1570/3079 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23009 event pairs, 1390 based on Foata normal form. 398/3085 useless extension candidates. Maximal degree in co-relation 5399. Up to 2256 conditions per place. [2023-11-06 22:54:31,557 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 24 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-06 22:54:31,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 159 flow [2023-11-06 22:54:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:54:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:54:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 400 transitions. [2023-11-06 22:54:31,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2023-11-06 22:54:31,561 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 400 transitions. [2023-11-06 22:54:31,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 400 transitions. [2023-11-06 22:54:31,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:31,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 400 transitions. [2023-11-06 22:54:31,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 200.0) internal successors, (400), 2 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) [2023-11-06 22:54:31,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 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) [2023-11-06 22:54:31,567 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 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) [2023-11-06 22:54:31,568 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 123 flow. Second operand 2 states and 400 transitions. [2023-11-06 22:54:31,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 159 flow [2023-11-06 22:54:31,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:54:31,573 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 110 flow [2023-11-06 22:54:31,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-11-06 22:54:31,575 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-06 22:54:31,575 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 110 flow [2023-11-06 22:54:31,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 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) [2023-11-06 22:54:31,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:31,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:54:31,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:54:31,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-06 22:54:31,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash 30481886, now seen corresponding path program 1 times [2023-11-06 22:54:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047481556] [2023-11-06 22:54:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:31,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047481556] [2023-11-06 22:54:31,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047481556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:31,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:54:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866201560] [2023-11-06 22:54:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:31,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:54:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:31,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:54:31,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:54:31,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 376 [2023-11-06 22:54:31,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) [2023-11-06 22:54:31,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:31,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 376 [2023-11-06 22:54:31,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:33,215 INFO L124 PetriNetUnfolderBase]: 6015/10170 cut-off events. [2023-11-06 22:54:33,216 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-11-06 22:54:33,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19016 conditions, 10170 events. 6015/10170 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 78698 event pairs, 2664 based on Foata normal form. 0/8798 useless extension candidates. Maximal degree in co-relation 19011. Up to 5493 conditions per place. [2023-11-06 22:54:33,324 INFO L140 encePairwiseOnDemand]: 365/376 looper letters, 51 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2023-11-06 22:54:33,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 290 flow [2023-11-06 22:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:54:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:54:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-11-06 22:54:33,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2023-11-06 22:54:33,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-11-06 22:54:33,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-11-06 22:54:33,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:33,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-11-06 22:54:33,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 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) [2023-11-06 22:54:33,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 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) [2023-11-06 22:54:33,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 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) [2023-11-06 22:54:33,340 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 110 flow. Second operand 3 states and 572 transitions. [2023-11-06 22:54:33,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 290 flow [2023-11-06 22:54:33,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:54:33,343 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 180 flow [2023-11-06 22:54:33,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-11-06 22:54:33,348 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2023-11-06 22:54:33,348 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 180 flow [2023-11-06 22:54:33,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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) [2023-11-06 22:54:33,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:33,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:54:33,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:54:33,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-06 22:54:33,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash 945010163, now seen corresponding path program 1 times [2023-11-06 22:54:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:33,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265668183] [2023-11-06 22:54:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265668183] [2023-11-06 22:54:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265668183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:54:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85873622] [2023-11-06 22:54:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:33,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:54:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:54:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:54:33,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 376 [2023-11-06 22:54:33,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2023-11-06 22:54:33,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:33,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 376 [2023-11-06 22:54:33,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:35,729 INFO L124 PetriNetUnfolderBase]: 11380/17963 cut-off events. [2023-11-06 22:54:35,729 INFO L125 PetriNetUnfolderBase]: For 3223/3223 co-relation queries the response was YES. [2023-11-06 22:54:35,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38489 conditions, 17963 events. 11380/17963 cut-off events. For 3223/3223 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 124980 event pairs, 9475 based on Foata normal form. 0/15892 useless extension candidates. Maximal degree in co-relation 38482. Up to 15696 conditions per place. [2023-11-06 22:54:35,890 INFO L140 encePairwiseOnDemand]: 371/376 looper letters, 33 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-06 22:54:35,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 240 flow [2023-11-06 22:54:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:54:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:54:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-11-06 22:54:35,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645390070921986 [2023-11-06 22:54:35,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-11-06 22:54:35,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-11-06 22:54:35,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:35,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-11-06 22:54:35,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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) [2023-11-06 22:54:35,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 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) [2023-11-06 22:54:35,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 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) [2023-11-06 22:54:35,907 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 180 flow. Second operand 3 states and 524 transitions. [2023-11-06 22:54:35,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 240 flow [2023-11-06 22:54:35,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:54:35,971 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 158 flow [2023-11-06 22:54:35,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-06 22:54:35,973 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-06 22:54:35,973 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 158 flow [2023-11-06 22:54:35,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2023-11-06 22:54:35,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:35,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:35,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:54:35,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-06 22:54:35,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1638873528, now seen corresponding path program 1 times [2023-11-06 22:54:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325023384] [2023-11-06 22:54:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:54:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:54:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:54:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325023384] [2023-11-06 22:54:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325023384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:54:36,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:54:36,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:54:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329662228] [2023-11-06 22:54:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:54:36,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:54:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:54:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:54:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:54:36,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 376 [2023-11-06 22:54:36,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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) [2023-11-06 22:54:36,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:54:36,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 376 [2023-11-06 22:54:36,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:54:37,278 INFO L124 PetriNetUnfolderBase]: 5253/9041 cut-off events. [2023-11-06 22:54:37,279 INFO L125 PetriNetUnfolderBase]: For 1006/1006 co-relation queries the response was YES. [2023-11-06 22:54:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18732 conditions, 9041 events. 5253/9041 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 70994 event pairs, 3370 based on Foata normal form. 0/7675 useless extension candidates. Maximal degree in co-relation 18725. Up to 6748 conditions per place. [2023-11-06 22:54:37,357 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 41 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-11-06 22:54:37,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 311 flow [2023-11-06 22:54:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:54:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:54:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2023-11-06 22:54:37,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500886524822695 [2023-11-06 22:54:37,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2023-11-06 22:54:37,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2023-11-06 22:54:37,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:54:37,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2023-11-06 22:54:37,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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) [2023-11-06 22:54:37,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 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) [2023-11-06 22:54:37,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 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) [2023-11-06 22:54:37,369 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 158 flow. Second operand 3 states and 565 transitions. [2023-11-06 22:54:37,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 311 flow [2023-11-06 22:54:37,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:54:37,372 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 226 flow [2023-11-06 22:54:37,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2023-11-06 22:54:37,373 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-06 22:54:37,374 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 226 flow [2023-11-06 22:54:37,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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) [2023-11-06 22:54:37,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:54:37,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:54:37,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:54:37,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-06 22:54:37,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:54:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1067807087, now seen corresponding path program 1 times [2023-11-06 22:54:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:54:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438922017] [2023-11-06 22:54:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:54:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:54:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:54:37,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:54:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:54:37,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:54:37,523 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:54:37,523 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2023-11-06 22:54:37,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-06 22:54:37,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-06 22:54:37,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-06 22:54:37,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-06 22:54:37,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-06 22:54:37,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-06 22:54:37,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-06 22:54:37,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-06 22:54:37,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-06 22:54:37,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-06 22:54:37,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2023-11-06 22:54:37,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2023-11-06 22:54:37,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-06 22:54:37,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-06 22:54:37,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-06 22:54:37,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-06 22:54:37,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-06 22:54:37,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-06 22:54:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-06 22:54:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-06 22:54:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-06 22:54:37,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:54:37,529 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:54:37,535 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-06 22:54:37,535 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:54:37,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:54:37 BasicIcfg [2023-11-06 22:54:37,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:54:37,618 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:54:37,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:54:37,619 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:54:37,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:16" (3/4) ... [2023-11-06 22:54:37,622 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:54:37,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:54:37,624 INFO L158 Benchmark]: Toolchain (without parser) took 22098.17ms. Allocated memory was 130.0MB in the beginning and 801.1MB in the end (delta: 671.1MB). Free memory was 85.1MB in the beginning and 544.5MB in the end (delta: -459.5MB). Peak memory consumption was 211.5MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,624 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 98.6MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:54:37,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 683.58ms. Allocated memory is still 130.0MB. Free memory was 84.4MB in the beginning and 88.5MB in the end (delta: -4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.89ms. Allocated memory is still 130.0MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,625 INFO L158 Benchmark]: Boogie Preprocessor took 70.89ms. Allocated memory is still 130.0MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,626 INFO L158 Benchmark]: RCFGBuilder took 525.05ms. Allocated memory is still 130.0MB. Free memory was 84.2MB in the beginning and 68.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,626 INFO L158 Benchmark]: TraceAbstraction took 20710.35ms. Allocated memory was 130.0MB in the beginning and 801.1MB in the end (delta: 671.1MB). Free memory was 67.5MB in the beginning and 545.6MB in the end (delta: -478.1MB). Peak memory consumption was 193.7MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,627 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 801.1MB. Free memory was 545.6MB in the beginning and 544.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:54:37,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 98.6MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 683.58ms. Allocated memory is still 130.0MB. Free memory was 84.4MB in the beginning and 88.5MB in the end (delta: -4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.89ms. Allocated memory is still 130.0MB. Free memory was 87.8MB in the beginning and 85.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.89ms. Allocated memory is still 130.0MB. Free memory was 85.7MB in the beginning and 84.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.05ms. Allocated memory is still 130.0MB. Free memory was 84.2MB in the beginning and 68.2MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20710.35ms. Allocated memory was 130.0MB in the beginning and 801.1MB in the end (delta: 671.1MB). Free memory was 67.5MB in the beginning and 545.6MB in the end (delta: -478.1MB). Peak memory consumption was 193.7MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 801.1MB. Free memory was 545.6MB in the beginning and 544.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 141 PlacesBefore, 37 PlacesAfterwards, 142 TransitionsBefore, 34 TransitionsAfterwards, 4284 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 159 TotalNumberOfCompositions, 12472 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6352, independent: 5996, independent conditional: 0, independent unconditional: 5996, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2700, independent: 2641, independent conditional: 0, independent unconditional: 2641, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6352, independent: 3355, independent conditional: 0, independent unconditional: 3355, dependent: 297, dependent conditional: 0, dependent unconditional: 297, unknown: 2700, unknown conditional: 0, unknown unconditional: 2700] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 174 PlacesBefore, 59 PlacesAfterwards, 175 TransitionsBefore, 55 TransitionsAfterwards, 9448 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 24 ConcurrentYvCompositions, 5 ChoiceCompositions, 177 TotalNumberOfCompositions, 36719 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13698, independent: 13038, independent conditional: 0, independent unconditional: 13038, dependent: 660, dependent conditional: 0, dependent unconditional: 660, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5488, independent: 5404, independent conditional: 0, independent unconditional: 5404, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13698, independent: 7634, independent conditional: 0, independent unconditional: 7634, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 5488, unknown conditional: 0, unknown unconditional: 5488] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 356, Positive conditional cache size: 0, Positive unconditional cache size: 356, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; [L691] 0 volatile int n; [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L708] 0 pthread_t t1, t2; [L709] 0 x = 0 [L710] 0 n = __VERIFIER_nondet_uint() [L711] EXPR 0 n >= (10/2) [L711] EXPR 0 n >= (10/2) && n <= 10 [L711] EXPR 0 n <= 10 [L711] EXPR 0 n >= (10/2) && n <= 10 [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L687] COND FALSE 0 !(!cond) [L711] RET 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, mut={3:0}, n=5, pthread_create(&t1, 0, thr1, 0)=-2, t1={5:0}, t2={6:0}, x=0] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=5, x=0] [L713] 0 int i = 0; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=0, mut={3:0}, n=5, t1={5:0}, t2={6:0}, x=0] [L713] 0 i < n [L713] COND TRUE 0 i < n [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=0, mut={3:0}, n=5, pthread_create(&t2, 0, thr2, 0)=-1, t1={5:0}, t2={6:0}, x=0] [L697] 2 int t; [L698] 2 int k = __VERIFIER_nondet_uint(); [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [arg={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L702] 2 k == n [L702] COND TRUE 2 k == n VAL [arg={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L703] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x = t + 1=52, x=1] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=5, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x < n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 190 locations, 17 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: 8.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 14 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 0.2s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 242 locations, 22 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: 11.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 58 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, InterpolantAutomatonStates: 11, 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, 0.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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! [2023-11-06 22:54:37,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f10e048f-c3a7-45b4-9bc9-197f2bd11c30/bin/uautomizer-verify-WvqO1wxjHP/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