./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc 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_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:56:20,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:56:21,122 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:56:21,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:56:21,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:56:21,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:56:21,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:56:21,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:56:21,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:56:21,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:56:21,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:56:21,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:56:21,179 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:56:21,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:56:21,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:56:21,181 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:56:21,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:56:21,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:56:21,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:56:21,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:56:21,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:56:21,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:56:21,184 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:56:21,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:56:21,185 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:56:21,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:56:21,186 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:56:21,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:56:21,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:56:21,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:56:21,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:21,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:56:21,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:56:21,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:56:21,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:56:21,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:56:21,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:56:21,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:56:21,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:56:21,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:56:21,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:56:21,191 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_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/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_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a [2023-11-26 11:56:21,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:56:21,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:56:21,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:56:21,570 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:56:21,571 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:56:21,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-deagle/airline-10.i [2023-11-26 11:56:24,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:56:25,042 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:56:25,043 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/sv-benchmarks/c/pthread-deagle/airline-10.i [2023-11-26 11:56:25,058 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/data/77b0fb5da/9b163f587a4d45e1b31d36712c3053bd/FLAGba0ce25da [2023-11-26 11:56:25,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/data/77b0fb5da/9b163f587a4d45e1b31d36712c3053bd [2023-11-26 11:56:25,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:56:25,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:56:25,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:25,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:56:25,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:56:25,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207e43d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25, skipping insertion in model container [2023-11-26 11:56:25,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,161 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:56:25,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:25,618 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:56:25,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:25,747 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:56:25,747 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:56:25,755 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:56:25,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25 WrapperNode [2023-11-26 11:56:25,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:25,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:25,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:56:25,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:56:25,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,837 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-11-26 11:56:25,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:25,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:56:25,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:56:25,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:56:25,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:56:25,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:56:25,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:56:25,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:56:25,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (1/1) ... [2023-11-26 11:56:25,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:56:25,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:25,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:56:25,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:56:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:56:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:56:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:56:25,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:56:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:56:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2023-11-26 11:56:25,971 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2023-11-26 11:56:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:56:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:56:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:56:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:56:25,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:56:25,975 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:56:26,174 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:56:26,177 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:56:26,472 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:56:26,512 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:56:26,512 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:56:26,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:26 BoogieIcfgContainer [2023-11-26 11:56:26,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:56:26,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:56:26,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:56:26,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:56:26,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:56:25" (1/3) ... [2023-11-26 11:56:26,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a616c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:26, skipping insertion in model container [2023-11-26 11:56:26,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:25" (2/3) ... [2023-11-26 11:56:26,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a616c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:56:26, skipping insertion in model container [2023-11-26 11:56:26,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:26" (3/3) ... [2023-11-26 11:56:26,524 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-10.i [2023-11-26 11:56:26,534 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:56:26,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:56:26,546 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:56:26,546 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:56:26,597 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-26 11:56:26,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 92 transitions, 191 flow [2023-11-26 11:56:26,702 INFO L124 PetriNetUnfolderBase]: 11/131 cut-off events. [2023-11-26 11:56:26,703 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:56:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 131 events. 11/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 322 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-11-26 11:56:26,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 92 transitions, 191 flow [2023-11-26 11:56:26,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 92 transitions, 191 flow [2023-11-26 11:56:26,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:56:26,734 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=LoopHeads, 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;@3c7b2e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:56:26,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-26 11:56:26,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:56:26,753 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 11:56:26,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:56:26,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:26,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:26,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:56:26,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1557855436, now seen corresponding path program 1 times [2023-11-26 11:56:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:26,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752955246] [2023-11-26 11:56:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:26,980 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-26 11:56:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752955246] [2023-11-26 11:56:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752955246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:26,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:56:26,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623134561] [2023-11-26 11:56:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:26,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:56:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:27,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:56:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:56:27,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2023-11-26 11:56:27,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 191 flow. Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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-26 11:56:27,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:27,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2023-11-26 11:56:27,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:27,097 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-11-26 11:56:27,097 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2023-11-26 11:56:27,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 264 event pairs, 0 based on Foata normal form. 10/108 useless extension candidates. Maximal degree in co-relation 56. Up to 8 conditions per place. [2023-11-26 11:56:27,100 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 7 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-11-26 11:56:27,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 181 flow [2023-11-26 11:56:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:56:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 11:56:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2023-11-26 11:56:27,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9021739130434783 [2023-11-26 11:56:27,122 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2023-11-26 11:56:27,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2023-11-26 11:56:27,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:27,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2023-11-26 11:56:27,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 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-26 11:56:27,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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-26 11:56:27,135 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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-26 11:56:27,137 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 191 flow. Second operand 2 states and 166 transitions. [2023-11-26 11:56:27,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 181 flow [2023-11-26 11:56:27,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:56:27,145 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 167 flow [2023-11-26 11:56:27,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=167, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-26 11:56:27,152 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2023-11-26 11:56:27,152 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 167 flow [2023-11-26 11:56:27,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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-26 11:56:27,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:27,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:27,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:56:27,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:56:27,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -974512921, now seen corresponding path program 1 times [2023-11-26 11:56:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063296618] [2023-11-26 11:56:27,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:27,333 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-26 11:56:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:27,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063296618] [2023-11-26 11:56:27,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063296618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:56:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042726728] [2023-11-26 11:56:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:27,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:27,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:27,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:27,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-26 11:56:27,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-26 11:56:27,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:27,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-26 11:56:27,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:27,446 INFO L124 PetriNetUnfolderBase]: 10/152 cut-off events. [2023-11-26 11:56:27,446 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 11:56:27,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 152 events. 10/152 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 378 event pairs, 0 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 181. Up to 23 conditions per place. [2023-11-26 11:56:27,449 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 13 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-26 11:56:27,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 201 flow [2023-11-26 11:56:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-26 11:56:27,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8079710144927537 [2023-11-26 11:56:27,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-26 11:56:27,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-26 11:56:27,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:27,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-26 11:56:27,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-26 11:56:27,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-26 11:56:27,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-26 11:56:27,460 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 167 flow. Second operand 3 states and 223 transitions. [2023-11-26 11:56:27,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 201 flow [2023-11-26 11:56:27,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:56:27,468 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 175 flow [2023-11-26 11:56:27,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2023-11-26 11:56:27,470 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-26 11:56:27,470 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 175 flow [2023-11-26 11:56:27,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-26 11:56:27,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:27,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:27,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:56:27,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:56:27,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -929159752, now seen corresponding path program 1 times [2023-11-26 11:56:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:27,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831228166] [2023-11-26 11:56:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:27,611 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-26 11:56:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831228166] [2023-11-26 11:56:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831228166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64591934] [2023-11-26 11:56:27,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:27,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:27,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2023-11-26 11:56:27,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-26 11:56:27,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:27,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2023-11-26 11:56:27,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:27,669 INFO L124 PetriNetUnfolderBase]: 1/141 cut-off events. [2023-11-26 11:56:27,669 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2023-11-26 11:56:27,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 141 events. 1/141 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 159. Up to 7 conditions per place. [2023-11-26 11:56:27,671 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 8 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-11-26 11:56:27,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 80 transitions, 198 flow [2023-11-26 11:56:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-11-26 11:56:27,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.822463768115942 [2023-11-26 11:56:27,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-11-26 11:56:27,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-11-26 11:56:27,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:27,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-11-26 11:56:27,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-26 11:56:27,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-26 11:56:27,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-26 11:56:27,679 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 175 flow. Second operand 3 states and 227 transitions. [2023-11-26 11:56:27,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 80 transitions, 198 flow [2023-11-26 11:56:27,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:27,683 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 173 flow [2023-11-26 11:56:27,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-11-26 11:56:27,684 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -5 predicate places. [2023-11-26 11:56:27,684 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 173 flow [2023-11-26 11:56:27,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-26 11:56:27,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:27,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:56:27,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:56:27,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 466346869, now seen corresponding path program 1 times [2023-11-26 11:56:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196219689] [2023-11-26 11:56:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:27,788 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-26 11:56:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196219689] [2023-11-26 11:56:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196219689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:27,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439727786] [2023-11-26 11:56:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:27,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:27,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:27,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-26 11:56:27,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-26 11:56:27,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:27,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-26 11:56:27,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:27,893 INFO L124 PetriNetUnfolderBase]: 8/215 cut-off events. [2023-11-26 11:56:27,893 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2023-11-26 11:56:27,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 215 events. 8/215 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 780 event pairs, 4 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 259. Up to 25 conditions per place. [2023-11-26 11:56:27,895 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-11-26 11:56:27,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 214 flow [2023-11-26 11:56:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-26 11:56:27,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8152173913043478 [2023-11-26 11:56:27,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-26 11:56:27,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-26 11:56:27,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:27,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-26 11:56:27,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-26 11:56:27,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-26 11:56:27,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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-26 11:56:27,902 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 173 flow. Second operand 3 states and 225 transitions. [2023-11-26 11:56:27,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 214 flow [2023-11-26 11:56:27,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:27,906 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 197 flow [2023-11-26 11:56:27,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2023-11-26 11:56:27,907 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-26 11:56:27,907 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 197 flow [2023-11-26 11:56:27,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-26 11:56:27,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:27,908 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:27,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:56:27,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 11:56:27,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -432073854, now seen corresponding path program 1 times [2023-11-26 11:56:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330084345] [2023-11-26 11:56:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:27,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:28,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:28,010 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:56:28,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2023-11-26 11:56:28,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-26 11:56:28,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-11-26 11:56:28,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-11-26 11:56:28,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-26 11:56:28,014 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-26 11:56:28,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-26 11:56:28,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-26 11:56:28,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-26 11:56:28,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-11-26 11:56:28,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-26 11:56:28,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-26 11:56:28,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-26 11:56:28,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-26 11:56:28,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:56:28,017 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 11:56:28,020 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:56:28,020 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 11:56:28,047 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-26 11:56:28,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 113 transitions, 242 flow [2023-11-26 11:56:28,095 INFO L124 PetriNetUnfolderBase]: 22/237 cut-off events. [2023-11-26 11:56:28,095 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 11:56:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 237 events. 22/237 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 669 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-11-26 11:56:28,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 113 transitions, 242 flow [2023-11-26 11:56:28,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 113 transitions, 242 flow [2023-11-26 11:56:28,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:56:28,114 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=LoopHeads, 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;@3c7b2e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:56:28,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-26 11:56:28,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:56:28,117 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 11:56:28,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:56:28,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:28,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:28,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:56:28,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash -216625716, now seen corresponding path program 1 times [2023-11-26 11:56:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:28,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049267060] [2023-11-26 11:56:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:28,168 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-26 11:56:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049267060] [2023-11-26 11:56:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049267060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:28,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:56:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260965789] [2023-11-26 11:56:28,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:28,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:56:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:56:28,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:56:28,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2023-11-26 11:56:28,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 113 transitions, 242 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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-26 11:56:28,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:28,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2023-11-26 11:56:28,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:28,248 INFO L124 PetriNetUnfolderBase]: 19/231 cut-off events. [2023-11-26 11:56:28,249 INFO L125 PetriNetUnfolderBase]: For 35/41 co-relation queries the response was YES. [2023-11-26 11:56:28,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 231 events. 19/231 cut-off events. For 35/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 781 event pairs, 4 based on Foata normal form. 26/227 useless extension candidates. Maximal degree in co-relation 136. Up to 30 conditions per place. [2023-11-26 11:56:28,252 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 11 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2023-11-26 11:56:28,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 99 transitions, 236 flow [2023-11-26 11:56:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:56:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 11:56:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-26 11:56:28,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8938053097345132 [2023-11-26 11:56:28,254 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-26 11:56:28,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-26 11:56:28,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:28,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-26 11:56:28,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 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-26 11:56:28,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-26 11:56:28,261 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-26 11:56:28,261 INFO L175 Difference]: Start difference. First operand has 108 places, 113 transitions, 242 flow. Second operand 2 states and 202 transitions. [2023-11-26 11:56:28,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 99 transitions, 236 flow [2023-11-26 11:56:28,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:56:28,268 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 214 flow [2023-11-26 11:56:28,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=99} [2023-11-26 11:56:28,272 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -9 predicate places. [2023-11-26 11:56:28,272 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 214 flow [2023-11-26 11:56:28,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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-26 11:56:28,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:28,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:28,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:56:28,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:56:28,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash -645241721, now seen corresponding path program 1 times [2023-11-26 11:56:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003904861] [2023-11-26 11:56:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:28,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:28,363 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-26 11:56:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003904861] [2023-11-26 11:56:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003904861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:28,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:56:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869288945] [2023-11-26 11:56:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:28,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:28,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:28,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-26 11:56:28,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-26 11:56:28,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:28,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-26 11:56:28,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:28,490 INFO L124 PetriNetUnfolderBase]: 59/445 cut-off events. [2023-11-26 11:56:28,491 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-26 11:56:28,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 445 events. 59/445 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2319 event pairs, 10 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 556. Up to 94 conditions per place. [2023-11-26 11:56:28,496 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 18 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-26 11:56:28,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 260 flow [2023-11-26 11:56:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-26 11:56:28,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053097345132744 [2023-11-26 11:56:28,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-26 11:56:28,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-26 11:56:28,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:28,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-26 11:56:28,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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-26 11:56:28,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-26 11:56:28,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-26 11:56:28,502 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 214 flow. Second operand 3 states and 273 transitions. [2023-11-26 11:56:28,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 260 flow [2023-11-26 11:56:28,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:56:28,509 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 226 flow [2023-11-26 11:56:28,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2023-11-26 11:56:28,511 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2023-11-26 11:56:28,512 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 226 flow [2023-11-26 11:56:28,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-26 11:56:28,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:28,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:28,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:56:28,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:56:28,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 688878998, now seen corresponding path program 1 times [2023-11-26 11:56:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710635829] [2023-11-26 11:56:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:28,578 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-26 11:56:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:28,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710635829] [2023-11-26 11:56:28,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710635829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:28,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:28,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:28,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091723819] [2023-11-26 11:56:28,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:28,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-26 11:56:28,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-26 11:56:28,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:28,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-26 11:56:28,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:28,780 INFO L124 PetriNetUnfolderBase]: 60/739 cut-off events. [2023-11-26 11:56:28,780 INFO L125 PetriNetUnfolderBase]: For 125/311 co-relation queries the response was YES. [2023-11-26 11:56:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 739 events. 60/739 cut-off events. For 125/311 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4838 event pairs, 11 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 901. Up to 59 conditions per place. [2023-11-26 11:56:28,787 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 22 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-11-26 11:56:28,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 315 flow [2023-11-26 11:56:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-11-26 11:56:28,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.831858407079646 [2023-11-26 11:56:28,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-11-26 11:56:28,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-11-26 11:56:28,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:28,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-11-26 11:56:28,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-26 11:56:28,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-26 11:56:28,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-26 11:56:28,794 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 226 flow. Second operand 3 states and 282 transitions. [2023-11-26 11:56:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 315 flow [2023-11-26 11:56:28,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 111 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:56:28,798 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 276 flow [2023-11-26 11:56:28,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2023-11-26 11:56:28,800 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2023-11-26 11:56:28,801 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 276 flow [2023-11-26 11:56:28,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-26 11:56:28,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:28,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:28,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:56:28,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:56:28,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1040897320, now seen corresponding path program 1 times [2023-11-26 11:56:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142799766] [2023-11-26 11:56:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:28,874 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-26 11:56:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142799766] [2023-11-26 11:56:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142799766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:28,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686349375] [2023-11-26 11:56:28,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:28,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:28,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-26 11:56:28,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 106 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-26 11:56:28,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:28,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-26 11:56:28,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:29,253 INFO L124 PetriNetUnfolderBase]: 272/1930 cut-off events. [2023-11-26 11:56:29,254 INFO L125 PetriNetUnfolderBase]: For 392/838 co-relation queries the response was YES. [2023-11-26 11:56:29,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1930 events. 272/1930 cut-off events. For 392/838 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17298 event pairs, 91 based on Foata normal form. 1/1670 useless extension candidates. Maximal degree in co-relation 2711. Up to 395 conditions per place. [2023-11-26 11:56:29,267 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2023-11-26 11:56:29,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 391 flow [2023-11-26 11:56:29,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-11-26 11:56:29,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2023-11-26 11:56:29,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-11-26 11:56:29,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-11-26 11:56:29,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:29,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-11-26 11:56:29,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-26 11:56:29,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-26 11:56:29,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-26 11:56:29,273 INFO L175 Difference]: Start difference. First operand has 105 places, 106 transitions, 276 flow. Second operand 3 states and 279 transitions. [2023-11-26 11:56:29,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 391 flow [2023-11-26 11:56:29,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:29,280 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 334 flow [2023-11-26 11:56:29,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2023-11-26 11:56:29,282 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2023-11-26 11:56:29,282 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 334 flow [2023-11-26 11:56:29,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-26 11:56:29,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:29,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:29,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:56:29,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:56:29,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash -457973571, now seen corresponding path program 1 times [2023-11-26 11:56:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706024090] [2023-11-26 11:56:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:29,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:29,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:29,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706024090] [2023-11-26 11:56:29,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706024090] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:29,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515617013] [2023-11-26 11:56:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:29,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:56:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:29,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:56:29,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:56:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:29,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:56:29,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:29,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:29,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515617013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:29,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:56:29,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 11:56:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014797241] [2023-11-26 11:56:29,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:56:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:29,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:56:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:56:29,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-26 11:56:29,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 334 flow. Second operand has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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-26 11:56:29,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:29,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-26 11:56:29,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:29,907 INFO L124 PetriNetUnfolderBase]: 165/615 cut-off events. [2023-11-26 11:56:29,907 INFO L125 PetriNetUnfolderBase]: For 368/420 co-relation queries the response was YES. [2023-11-26 11:56:29,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 615 events. 165/615 cut-off events. For 368/420 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4273 event pairs, 5 based on Foata normal form. 37/600 useless extension candidates. Maximal degree in co-relation 1229. Up to 104 conditions per place. [2023-11-26 11:56:29,913 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-11-26 11:56:29,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 494 flow [2023-11-26 11:56:29,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:56:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:56:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions. [2023-11-26 11:56:29,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561455260570304 [2023-11-26 11:56:29,917 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions. [2023-11-26 11:56:29,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions. [2023-11-26 11:56:29,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:29,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions. [2023-11-26 11:56:29,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.44444444444444) internal successors, (769), 9 states have internal predecessors, (769), 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-26 11:56:29,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-26 11:56:29,925 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 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-26 11:56:29,925 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 334 flow. Second operand 9 states and 769 transitions. [2023-11-26 11:56:29,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 494 flow [2023-11-26 11:56:29,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:29,930 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 246 flow [2023-11-26 11:56:29,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-26 11:56:29,932 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -27 predicate places. [2023-11-26 11:56:29,932 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 246 flow [2023-11-26 11:56:29,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 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-26 11:56:29,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:29,937 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:29,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:56:30,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-26 11:56:30,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 11:56:30,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1772929582, now seen corresponding path program 1 times [2023-11-26 11:56:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832275126] [2023-11-26 11:56:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:30,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:30,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:30,198 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:56:30,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-26 11:56:30,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-26 11:56:30,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-26 11:56:30,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-26 11:56:30,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-26 11:56:30,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-26 11:56:30,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-26 11:56:30,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-26 11:56:30,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-26 11:56:30,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-11-26 11:56:30,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-11-26 11:56:30,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-26 11:56:30,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-26 11:56:30,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-26 11:56:30,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-26 11:56:30,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-26 11:56:30,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-26 11:56:30,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-26 11:56:30,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:56:30,201 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 11:56:30,202 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:56:30,202 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 11:56:30,236 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 11:56:30,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 134 transitions, 295 flow [2023-11-26 11:56:30,299 INFO L124 PetriNetUnfolderBase]: 42/418 cut-off events. [2023-11-26 11:56:30,299 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-26 11:56:30,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 418 events. 42/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1425 event pairs, 1 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 245. Up to 16 conditions per place. [2023-11-26 11:56:30,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 134 transitions, 295 flow [2023-11-26 11:56:30,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 134 transitions, 295 flow [2023-11-26 11:56:30,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:56:30,311 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=LoopHeads, 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;@3c7b2e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:56:30,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-26 11:56:30,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:56:30,313 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 11:56:30,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:56:30,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:30,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:30,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:30,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1902783540, now seen corresponding path program 1 times [2023-11-26 11:56:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57375749] [2023-11-26 11:56:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:30,337 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-26 11:56:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57375749] [2023-11-26 11:56:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57375749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:30,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:30,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:56:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937162195] [2023-11-26 11:56:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:30,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:56:30,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:56:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:56:30,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2023-11-26 11:56:30,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 134 transitions, 295 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 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-26 11:56:30,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:30,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2023-11-26 11:56:30,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:30,458 INFO L124 PetriNetUnfolderBase]: 91/514 cut-off events. [2023-11-26 11:56:30,458 INFO L125 PetriNetUnfolderBase]: For 180/200 co-relation queries the response was YES. [2023-11-26 11:56:30,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 514 events. 91/514 cut-off events. For 180/200 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2378 event pairs, 27 based on Foata normal form. 72/523 useless extension candidates. Maximal degree in co-relation 362. Up to 122 conditions per place. [2023-11-26 11:56:30,465 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 15 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-11-26 11:56:30,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 118 transitions, 293 flow [2023-11-26 11:56:30,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:56:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 11:56:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-11-26 11:56:30,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2023-11-26 11:56:30,467 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-11-26 11:56:30,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-11-26 11:56:30,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:30,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-11-26 11:56:30,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 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-26 11:56:30,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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-26 11:56:30,471 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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-26 11:56:30,471 INFO L175 Difference]: Start difference. First operand has 128 places, 134 transitions, 295 flow. Second operand 2 states and 238 transitions. [2023-11-26 11:56:30,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 118 transitions, 293 flow [2023-11-26 11:56:30,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:56:30,475 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 263 flow [2023-11-26 11:56:30,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=263, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2023-11-26 11:56:30,476 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -11 predicate places. [2023-11-26 11:56:30,477 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 263 flow [2023-11-26 11:56:30,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 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-26 11:56:30,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:30,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:30,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:56:30,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:30,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649479, now seen corresponding path program 1 times [2023-11-26 11:56:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126788777] [2023-11-26 11:56:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:30,523 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-26 11:56:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126788777] [2023-11-26 11:56:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126788777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:56:30,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472515121] [2023-11-26 11:56:30,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:30,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:30,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 134 [2023-11-26 11:56:30,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-26 11:56:30,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:30,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 134 [2023-11-26 11:56:30,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:30,775 INFO L124 PetriNetUnfolderBase]: 234/1288 cut-off events. [2023-11-26 11:56:30,775 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-26 11:56:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 1288 events. 234/1288 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9034 event pairs, 64 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 1667. Up to 325 conditions per place. [2023-11-26 11:56:30,790 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 22 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2023-11-26 11:56:30,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 317 flow [2023-11-26 11:56:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-26 11:56:30,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2023-11-26 11:56:30,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-26 11:56:30,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-26 11:56:30,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:30,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-26 11:56:30,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-26 11:56:30,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-26 11:56:30,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-26 11:56:30,796 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 263 flow. Second operand 3 states and 322 transitions. [2023-11-26 11:56:30,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 317 flow [2023-11-26 11:56:30,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:56:30,800 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 275 flow [2023-11-26 11:56:30,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2023-11-26 11:56:30,801 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -8 predicate places. [2023-11-26 11:56:30,801 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 275 flow [2023-11-26 11:56:30,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-26 11:56:30,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:30,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:30,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:56:30,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:30,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1307333937, now seen corresponding path program 1 times [2023-11-26 11:56:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969799749] [2023-11-26 11:56:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:30,837 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-26 11:56:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969799749] [2023-11-26 11:56:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969799749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:30,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270605550] [2023-11-26 11:56:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:30,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:30,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:30,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-26 11:56:30,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-26 11:56:30,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:30,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-26 11:56:30,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:31,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 89#L721-1true, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 11:56:31,539 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:56:31,539 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-26 11:56:31,540 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 11:56:31,540 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 11:56:31,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 96#L721-2true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 11:56:31,540 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 11:56:31,540 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 11:56:31,541 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:31,541 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-26 11:56:31,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 11:56:31,587 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 11:56:31,587 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:31,587 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:31,587 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:31,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][120], [salethreadThread3of3ForFork0NotInUse, 139#true, 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 11:56:31,645 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:31,645 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:31,646 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:31,646 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:31,679 INFO L124 PetriNetUnfolderBase]: 724/4772 cut-off events. [2023-11-26 11:56:31,679 INFO L125 PetriNetUnfolderBase]: For 1376/3596 co-relation queries the response was YES. [2023-11-26 11:56:31,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 4772 events. 724/4772 cut-off events. For 1376/3596 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 51849 event pairs, 153 based on Foata normal form. 9/3960 useless extension candidates. Maximal degree in co-relation 6283. Up to 584 conditions per place. [2023-11-26 11:56:31,733 INFO L140 encePairwiseOnDemand]: 122/134 looper letters, 32 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2023-11-26 11:56:31,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 136 transitions, 412 flow [2023-11-26 11:56:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-26 11:56:31,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8258706467661692 [2023-11-26 11:56:31,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-26 11:56:31,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-26 11:56:31,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:31,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-26 11:56:31,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-26 11:56:31,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-26 11:56:31,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-26 11:56:31,740 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 275 flow. Second operand 3 states and 332 transitions. [2023-11-26 11:56:31,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 136 transitions, 412 flow [2023-11-26 11:56:31,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:56:31,745 INFO L231 Difference]: Finished difference. Result has 123 places, 128 transitions, 351 flow [2023-11-26 11:56:31,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=123, PETRI_TRANSITIONS=128} [2023-11-26 11:56:31,746 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2023-11-26 11:56:31,746 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 351 flow [2023-11-26 11:56:31,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-26 11:56:31,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:31,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:31,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:56:31,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:31,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash -21298053, now seen corresponding path program 1 times [2023-11-26 11:56:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:31,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561013326] [2023-11-26 11:56:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:31,781 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-26 11:56:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:31,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561013326] [2023-11-26 11:56:31,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561013326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:31,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:31,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:56:31,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840184679] [2023-11-26 11:56:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:31,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:56:31,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:31,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:56:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:56:31,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 134 [2023-11-26 11:56:31,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-26 11:56:31,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:31,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 134 [2023-11-26 11:56:31,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:34,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,158 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,158 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 11:56:34,158 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 11:56:34,158 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 11:56:34,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,159 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:56:34,159 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 11:56:34,159 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,159 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-26 11:56:34,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,160 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,160 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:34,160 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,160 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:34,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][81], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,161 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,161 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:34,161 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:34,161 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,195 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-26 11:56:34,196 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,196 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,196 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 131#true, 50#L752-1true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,212 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 11:56:34,212 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-26 11:56:34,212 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-26 11:56:34,212 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-26 11:56:34,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-26 11:56:34,262 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,262 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:34,262 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:34,263 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 11:56:34,263 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,263 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:34,264 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:34,264 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, salethreadThread1of3ForFork0InUse, 94#L722-2true, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,272 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,272 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 11:56:34,272 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 11:56:34,273 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 11:56:34,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L724-->L730: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{~stopSales~0=v_~stopSales~0_20, salethreadThread1of3ForFork0_#t~nondet1=|v_salethreadThread1of3ForFork0_#t~nondet1_3|, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread1of3ForFork0_#t~nondet1][47], [salethreadThread3of3ForFork0NotInUse, Black: 141#(= |#race~stopSales~0| 0), 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, 108#L721-2true, 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,273 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-26 11:56:34,273 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 11:56:34,273 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 11:56:34,274 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 11:56:34,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,344 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,344 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 11:56:34,345 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 11:56:34,345 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 11:56:34,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 94#L722-2true, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,407 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-26 11:56:34,407 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 11:56:34,407 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 11:56:34,407 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 11:56:34,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L724-->L730: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{~stopSales~0=v_~stopSales~0_20, salethreadThread1of3ForFork0_#t~nondet1=|v_salethreadThread1of3ForFork0_#t~nondet1_3|, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread1of3ForFork0_#t~nondet1][47], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, 108#L721-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,408 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:56:34,408 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 11:56:34,408 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 11:56:34,408 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 11:56:34,450 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,450 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,450 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 11:56:34,450 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,451 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-26 11:56:34,451 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:56:34,516 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,516 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 11:56:34,517 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 11:56:34,517 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 11:56:34,517 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,517 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 11:56:34,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,539 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,539 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 11:56:34,539 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-26 11:56:34,539 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 11:56:34,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,594 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 11:56:34,595 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,595 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-26 11:56:34,595 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 28#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-26 11:56:34,598 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 11:56:34,598 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,599 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-26 11:56:34,599 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 11:56:34,605 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 11:56:34,605 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,605 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 11:56:34,605 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 11:56:34,605 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,605 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 11:56:34,612 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,612 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,612 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:56:34,613 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 11:56:34,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][142], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,625 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,625 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:56:34,625 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 11:56:34,625 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 11:56:34,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][143], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,645 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,646 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,646 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:34,646 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:34,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true, 94#L722-2true]) [2023-11-26 11:56:34,728 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 11:56:34,728 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 11:56:34,729 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 11:56:34,729 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][142], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:34,749 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 11:56:34,749 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,749 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 11:56:34,749 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 11:56:35,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-26 11:56:35,065 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-26 11:56:35,065 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 11:56:35,065 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 11:56:35,065 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 11:56:35,085 INFO L124 PetriNetUnfolderBase]: 4754/19531 cut-off events. [2023-11-26 11:56:35,085 INFO L125 PetriNetUnfolderBase]: For 6179/14413 co-relation queries the response was YES. [2023-11-26 11:56:35,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30730 conditions, 19531 events. 4754/19531 cut-off events. For 6179/14413 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 255010 event pairs, 1453 based on Foata normal form. 28/16746 useless extension candidates. Maximal degree in co-relation 30721. Up to 5204 conditions per place. [2023-11-26 11:56:35,264 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 41 selfloop transitions, 11 changer transitions 0/150 dead transitions. [2023-11-26 11:56:35,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 150 transitions, 538 flow [2023-11-26 11:56:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:56:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:56:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-26 11:56:35,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.818407960199005 [2023-11-26 11:56:35,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-26 11:56:35,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-26 11:56:35,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:35,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-26 11:56:35,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-26 11:56:35,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-26 11:56:35,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-26 11:56:35,272 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 351 flow. Second operand 3 states and 329 transitions. [2023-11-26 11:56:35,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 150 transitions, 538 flow [2023-11-26 11:56:35,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 150 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:35,292 INFO L231 Difference]: Finished difference. Result has 125 places, 139 transitions, 429 flow [2023-11-26 11:56:35,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=125, PETRI_TRANSITIONS=139} [2023-11-26 11:56:35,294 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2023-11-26 11:56:35,294 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 429 flow [2023-11-26 11:56:35,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-26 11:56:35,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:35,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:35,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:56:35,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:35,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1810559632, now seen corresponding path program 1 times [2023-11-26 11:56:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:35,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369344603] [2023-11-26 11:56:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:35,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:35,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369344603] [2023-11-26 11:56:35,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369344603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:35,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531614297] [2023-11-26 11:56:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:35,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:56:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:35,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:56:35,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:56:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:56:35,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:35,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531614297] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:35,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:56:35,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 11:56:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770612791] [2023-11-26 11:56:35,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:56:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:56:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:56:35,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-26 11:56:35,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 139 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 98.4) internal successors, (984), 10 states have internal predecessors, (984), 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-26 11:56:35,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:35,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-26 11:56:35,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:39,718 INFO L124 PetriNetUnfolderBase]: 6843/29541 cut-off events. [2023-11-26 11:56:39,718 INFO L125 PetriNetUnfolderBase]: For 11830/14504 co-relation queries the response was YES. [2023-11-26 11:56:39,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50263 conditions, 29541 events. 6843/29541 cut-off events. For 11830/14504 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 413558 event pairs, 1394 based on Foata normal form. 159/25410 useless extension candidates. Maximal degree in co-relation 50253. Up to 5597 conditions per place. [2023-11-26 11:56:40,057 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 72 selfloop transitions, 9 changer transitions 0/189 dead transitions. [2023-11-26 11:56:40,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 189 transitions, 801 flow [2023-11-26 11:56:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:56:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:56:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2023-11-26 11:56:40,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7653399668325042 [2023-11-26 11:56:40,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2023-11-26 11:56:40,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2023-11-26 11:56:40,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:40,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2023-11-26 11:56:40,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 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-26 11:56:40,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-26 11:56:40,073 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 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-26 11:56:40,073 INFO L175 Difference]: Start difference. First operand has 125 places, 139 transitions, 429 flow. Second operand 9 states and 923 transitions. [2023-11-26 11:56:40,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 189 transitions, 801 flow [2023-11-26 11:56:40,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:56:40,318 INFO L231 Difference]: Finished difference. Result has 134 places, 145 transitions, 457 flow [2023-11-26 11:56:40,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=134, PETRI_TRANSITIONS=145} [2023-11-26 11:56:40,320 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2023-11-26 11:56:40,320 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 145 transitions, 457 flow [2023-11-26 11:56:40,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.4) internal successors, (984), 10 states have internal predecessors, (984), 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-26 11:56:40,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:40,321 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:40,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:56:40,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-26 11:56:40,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:40,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1744744612, now seen corresponding path program 1 times [2023-11-26 11:56:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799744158] [2023-11-26 11:56:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 11:56:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799744158] [2023-11-26 11:56:40,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799744158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:40,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:40,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:56:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629053954] [2023-11-26 11:56:40,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:56:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:56:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:56:40,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-26 11:56:40,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 145 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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-26 11:56:40,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:40,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-26 11:56:40,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:44,078 INFO L124 PetriNetUnfolderBase]: 5075/27838 cut-off events. [2023-11-26 11:56:44,078 INFO L125 PetriNetUnfolderBase]: For 5599/9439 co-relation queries the response was YES. [2023-11-26 11:56:44,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41170 conditions, 27838 events. 5075/27838 cut-off events. For 5599/9439 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 412368 event pairs, 1263 based on Foata normal form. 290/24503 useless extension candidates. Maximal degree in co-relation 41158. Up to 4173 conditions per place. [2023-11-26 11:56:44,268 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 55 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2023-11-26 11:56:44,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 183 transitions, 762 flow [2023-11-26 11:56:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:56:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:56:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-11-26 11:56:44,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2023-11-26 11:56:44,272 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-11-26 11:56:44,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-11-26 11:56:44,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:44,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-11-26 11:56:44,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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-26 11:56:44,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-26 11:56:44,278 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-26 11:56:44,278 INFO L175 Difference]: Start difference. First operand has 134 places, 145 transitions, 457 flow. Second operand 5 states and 555 transitions. [2023-11-26 11:56:44,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 183 transitions, 762 flow [2023-11-26 11:56:44,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 183 transitions, 756 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-26 11:56:44,287 INFO L231 Difference]: Finished difference. Result has 140 places, 152 transitions, 521 flow [2023-11-26 11:56:44,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=140, PETRI_TRANSITIONS=152} [2023-11-26 11:56:44,289 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 12 predicate places. [2023-11-26 11:56:44,289 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 152 transitions, 521 flow [2023-11-26 11:56:44,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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-26 11:56:44,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:44,290 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:44,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:56:44,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:44,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -547111440, now seen corresponding path program 1 times [2023-11-26 11:56:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619954875] [2023-11-26 11:56:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 11:56:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619954875] [2023-11-26 11:56:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619954875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:44,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:56:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050786056] [2023-11-26 11:56:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:44,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:56:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:56:44,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:56:44,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-26 11:56:44,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 152 transitions, 521 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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-26 11:56:44,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:56:44,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-26 11:56:44,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:56:46,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][177], [salethreadThread3of3ForFork0NotInUse, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 10), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 414#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:46,813 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:46,813 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:46,813 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:46,814 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:47,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][168], [salethreadThread3of3ForFork0NotInUse, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 10), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 414#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:47,221 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 11:56:47,221 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:47,221 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 11:56:47,221 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:56:47,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][144], [salethreadThread3of3ForFork0NotInUse, 411#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 10), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 116#L721-4true, Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:47,281 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-26 11:56:47,281 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 11:56:47,281 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 11:56:47,281 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 11:56:47,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][140], [salethreadThread3of3ForFork0NotInUse, 411#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 10), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 116#L721-4true, Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-26 11:56:47,318 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-26 11:56:47,318 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 11:56:47,318 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 11:56:47,318 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 11:56:47,796 INFO L124 PetriNetUnfolderBase]: 5072/28011 cut-off events. [2023-11-26 11:56:47,796 INFO L125 PetriNetUnfolderBase]: For 11635/15435 co-relation queries the response was YES. [2023-11-26 11:56:47,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44769 conditions, 28011 events. 5072/28011 cut-off events. For 11635/15435 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 416856 event pairs, 1316 based on Foata normal form. 432/24897 useless extension candidates. Maximal degree in co-relation 44753. Up to 3862 conditions per place. [2023-11-26 11:56:48,008 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 47 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2023-11-26 11:56:48,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 180 transitions, 791 flow [2023-11-26 11:56:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:56:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:56:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-11-26 11:56:48,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8223880597014925 [2023-11-26 11:56:48,012 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-11-26 11:56:48,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-11-26 11:56:48,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:48,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-11-26 11:56:48,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:56:48,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-26 11:56:48,018 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-26 11:56:48,019 INFO L175 Difference]: Start difference. First operand has 140 places, 152 transitions, 521 flow. Second operand 5 states and 551 transitions. [2023-11-26 11:56:48,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 180 transitions, 791 flow [2023-11-26 11:56:48,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:56:48,036 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 590 flow [2023-11-26 11:56:48,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2023-11-26 11:56:48,037 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places. [2023-11-26 11:56:48,037 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 590 flow [2023-11-26 11:56:48,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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-26 11:56:48,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:56:48,038 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:48,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:56:48,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 11:56:48,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:48,039 INFO L85 PathProgramCache]: Analyzing trace with hash 758635425, now seen corresponding path program 1 times [2023-11-26 11:56:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:48,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726826862] [2023-11-26 11:56:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:48,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:48,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:48,114 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:56:48,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2023-11-26 11:56:48,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-26 11:56:48,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-26 11:56:48,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-26 11:56:48,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-26 11:56:48,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-26 11:56:48,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-26 11:56:48,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-26 11:56:48,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-26 11:56:48,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-26 11:56:48,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2023-11-26 11:56:48,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-26 11:56:48,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-26 11:56:48,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-26 11:56:48,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-26 11:56:48,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-26 11:56:48,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-26 11:56:48,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-26 11:56:48,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-26 11:56:48,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-26 11:56:48,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-26 11:56:48,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-26 11:56:48,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:56:48,124 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:48,132 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-26 11:56:48,136 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:56:48,221 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:48,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:48,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:56:48 BasicIcfg [2023-11-26 11:56:48,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:56:48,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:56:48,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:56:48,419 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:56:48,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:26" (3/4) ... [2023-11-26 11:56:48,421 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:56:48,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:56:48,423 INFO L158 Benchmark]: Toolchain (without parser) took 23346.55ms. Allocated memory was 142.6MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 103.6MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 662.4MB. Max. memory is 16.1GB. [2023-11-26 11:56:48,424 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:56:48,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.43ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:56:48,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.23ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 81.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:56:48,425 INFO L158 Benchmark]: Boogie Preprocessor took 35.20ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 79.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:56:48,425 INFO L158 Benchmark]: RCFGBuilder took 639.17ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 62.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 11:56:48,425 INFO L158 Benchmark]: TraceAbstraction took 21900.95ms. Allocated memory was 142.6MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 62.2MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 995.8MB. Max. memory is 16.1GB. [2023-11-26 11:56:48,426 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 8.3GB. Free memory is still 7.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:56:48,428 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.30ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.43ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 83.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.23ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 81.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.20ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 79.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 639.17ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 62.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21900.95ms. Allocated memory was 142.6MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 62.2MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 995.8MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 8.3GB. Free memory is still 7.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected [2023-11-26 11:56:48,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:48,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:48,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:56:48,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[10]; VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=0, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 10 VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, argc=49, argv={52:50}, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=49, argc=49, argv={52:50}, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 10 VAL [\old(argc)=49, argc=49, argv={52:50}, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={52:50}, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={52:50}, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 10 VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={52:50}, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={52:50}, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (10 - (((10 / 10) == 0) ? 1 : (10 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: 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 3 procedures, 104 locations, 14 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: 1.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 11 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.4s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 122 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 19 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, InterpolantAutomatonStates: 20, 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.4s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 2 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 140 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: 17.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 31 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=7, InterpolantAutomatonStates: 30, 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.5s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 2 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10/13 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-26 11:56:48,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd6cdaa5-209b-417f-bbae-685658067de5/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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