./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:51:01,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:51:01,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:51:01,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:51:01,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:51:01,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:51:01,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:51:01,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:51:01,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:51:01,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:51:01,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:51:01,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:51:01,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:51:01,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:51:01,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:51:01,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:51:01,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:51:01,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:51:01,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:51:01,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:51:01,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:51:01,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:51:01,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:51:01,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:51:01,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:51:01,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:51:01,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:51:01,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:51:01,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:51:01,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:51:01,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:51:01,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:51:01,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:51:01,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:51:01,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:51:01,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:51:01,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:51:01,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:51:01,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:51:01,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:51:01,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:51:01,530 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 11:51:01,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:51:01,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:51:01,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:51:01,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:51:01,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:51:01,593 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:51:01,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:51:01,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:51:01,596 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:51:01,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:51:01,598 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:51:01,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:51:01,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:51:01,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:51:01,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:51:01,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:51:01,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:51:01,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:51:01,601 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 11:51:01,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:51:01,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:51:01,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:51:01,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:51:01,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:51:01,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:51:01,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:51:01,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:51:01,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:51:01,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:51:01,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:51:01,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:51:01,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:51:01,608 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:51:01,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:51:01,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:51:01,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/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_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d [2022-11-20 11:51:01,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:51:02,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:51:02,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:51:02,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:51:02,036 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:51:02,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-deagle/airline-25.i [2022-11-20 11:51:05,962 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:51:06,367 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:51:06,368 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/sv-benchmarks/c/pthread-deagle/airline-25.i [2022-11-20 11:51:06,383 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/data/79d88027c/3379b2309e5947f3a401449122c44761/FLAG86199a8dc [2022-11-20 11:51:06,403 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/data/79d88027c/3379b2309e5947f3a401449122c44761 [2022-11-20 11:51:06,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:51:06,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:51:06,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:51:06,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:51:06,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:51:06,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:51:06" (1/1) ... [2022-11-20 11:51:06,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae1b495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:06, skipping insertion in model container [2022-11-20 11:51:06,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:51:06" (1/1) ... [2022-11-20 11:51:06,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:51:06,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:51:06,896 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/sv-benchmarks/c/pthread-deagle/airline-25.i[32101,32114] [2022-11-20 11:51:06,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:51:06,910 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:51:06,965 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/sv-benchmarks/c/pthread-deagle/airline-25.i[32101,32114] [2022-11-20 11:51:06,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:51:07,025 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:51:07,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07 WrapperNode [2022-11-20 11:51:07,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:51:07,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:51:07,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:51:07,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:51:07,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,119 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-20 11:51:07,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:51:07,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:51:07,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:51:07,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:51:07,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,154 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:51:07,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:51:07,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:51:07,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:51:07,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (1/1) ... [2022-11-20 11:51:07,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:51:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:07,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:51:07,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:51:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:51:07,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:51:07,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:51:07,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:51:07,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:51:07,271 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-11-20 11:51:07,271 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-11-20 11:51:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:51:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:51:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:51:07,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:51:07,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:51:07,275 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:51:07,452 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:51:07,455 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:51:07,847 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:51:07,896 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:51:07,897 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 11:51:07,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:51:07 BoogieIcfgContainer [2022-11-20 11:51:07,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:51:07,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:51:07,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:51:07,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:51:07,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:51:06" (1/3) ... [2022-11-20 11:51:07,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0ffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:51:07, skipping insertion in model container [2022-11-20 11:51:07,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:51:07" (2/3) ... [2022-11-20 11:51:07,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0ffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:51:07, skipping insertion in model container [2022-11-20 11:51:07,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:51:07" (3/3) ... [2022-11-20 11:51:07,914 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-25.i [2022-11-20 11:51:07,926 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:51:07,939 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:51:07,939 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 11:51:07,939 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:51:08,045 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-20 11:51:08,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow [2022-11-20 11:51:08,246 INFO L130 PetriNetUnfolder]: 9/119 cut-off events. [2022-11-20 11:51:08,246 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-20 11:51:08,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 119 events. 9/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-11-20 11:51:08,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow [2022-11-20 11:51:08,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow [2022-11-20 11:51:08,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:51:08,301 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b61f6ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:51:08,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-20 11:51:08,325 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-20 11:51:08,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:51:08,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:08,327 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:08,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-20 11:51:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301244, now seen corresponding path program 1 times [2022-11-20 11:51:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623663244] [2022-11-20 11:51:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:08,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623663244] [2022-11-20 11:51:08,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623663244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:08,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:08,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:51:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821711500] [2022-11-20 11:51:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:08,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:51:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:51:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:51:08,740 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-11-20 11:51:08,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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) [2022-11-20 11:51:08,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:08,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-11-20 11:51:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:08,839 INFO L130 PetriNetUnfolder]: 3/106 cut-off events. [2022-11-20 11:51:08,839 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 11:51:08,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 106 events. 3/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 215 event pairs, 0 based on Foata normal form. 6/98 useless extension candidates. Maximal degree in co-relation 50. Up to 8 conditions per place. [2022-11-20 11:51:08,842 INFO L137 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2022-11-20 11:51:08,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow [2022-11-20 11:51:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:51:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 11:51:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2022-11-20 11:51:08,863 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909 [2022-11-20 11:51:08,864 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions. [2022-11-20 11:51:08,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions. [2022-11-20 11:51:08,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:08,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions. [2022-11-20 11:51:08,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 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) [2022-11-20 11:51:08,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) [2022-11-20 11:51:08,890 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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) [2022-11-20 11:51:08,893 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions. [2022-11-20 11:51:08,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow [2022-11-20 11:51:08,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:51:08,910 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2022-11-20 11:51:08,913 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2022-11-20 11:51:08,922 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2022-11-20 11:51:08,922 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2022-11-20 11:51:08,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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) [2022-11-20 11:51:08,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:08,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:08,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:51:08,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-20 11:51:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1828019146, now seen corresponding path program 1 times [2022-11-20 11:51:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:08,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896640655] [2022-11-20 11:51:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:09,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896640655] [2022-11-20 11:51:09,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896640655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:09,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:09,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:51:09,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736305230] [2022-11-20 11:51:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:09,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:09,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:09,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:09,239 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2022-11-20 11:51:09,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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) [2022-11-20 11:51:09,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:09,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2022-11-20 11:51:09,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:09,355 INFO L130 PetriNetUnfolder]: 12/148 cut-off events. [2022-11-20 11:51:09,355 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 11:51:09,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 148 events. 12/148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 343 event pairs, 3 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 185. Up to 23 conditions per place. [2022-11-20 11:51:09,357 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-11-20 11:51:09,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow [2022-11-20 11:51:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-11-20 11:51:09,361 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-11-20 11:51:09,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-11-20 11:51:09,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-11-20 11:51:09,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:09,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-11-20 11:51:09,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-11-20 11:51:09,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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) [2022-11-20 11:51:09,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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) [2022-11-20 11:51:09,365 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions. [2022-11-20 11:51:09,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow [2022-11-20 11:51:09,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:51:09,369 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow [2022-11-20 11:51:09,370 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=80, 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=174, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2022-11-20 11:51:09,371 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-20 11:51:09,371 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow [2022-11-20 11:51:09,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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) [2022-11-20 11:51:09,372 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:09,372 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:09,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:51:09,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-20 11:51:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash -311906661, now seen corresponding path program 1 times [2022-11-20 11:51:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:09,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735001772] [2022-11-20 11:51:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:09,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735001772] [2022-11-20 11:51:09,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735001772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:09,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:09,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885769087] [2022-11-20 11:51:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:09,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88 [2022-11-20 11:51:09,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 174 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) [2022-11-20 11:51:09,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:09,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88 [2022-11-20 11:51:09,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:09,505 INFO L130 PetriNetUnfolder]: 1/131 cut-off events. [2022-11-20 11:51:09,505 INFO L131 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2022-11-20 11:51:09,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 131 events. 1/131 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 150. Up to 7 conditions per place. [2022-11-20 11:51:09,507 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-11-20 11:51:09,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow [2022-11-20 11:51:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-11-20 11:51:09,510 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758 [2022-11-20 11:51:09,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2022-11-20 11:51:09,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2022-11-20 11:51:09,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:09,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2022-11-20 11:51:09,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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) [2022-11-20 11:51:09,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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) [2022-11-20 11:51:09,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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) [2022-11-20 11:51:09,515 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions. [2022-11-20 11:51:09,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow [2022-11-20 11:51:09,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:51:09,519 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow [2022-11-20 11:51:09,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2022-11-20 11:51:09,520 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2022-11-20 11:51:09,521 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow [2022-11-20 11:51:09,521 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) [2022-11-20 11:51:09,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:09,522 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:09,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:51:09,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-20 11:51:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1996792538, now seen corresponding path program 1 times [2022-11-20 11:51:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211727341] [2022-11-20 11:51:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:09,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211727341] [2022-11-20 11:51:09,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211727341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:09,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:09,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068410475] [2022-11-20 11:51:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:09,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:09,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2022-11-20 11:51:09,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2022-11-20 11:51:09,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:09,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2022-11-20 11:51:09,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:09,679 INFO L130 PetriNetUnfolder]: 7/188 cut-off events. [2022-11-20 11:51:09,680 INFO L131 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2022-11-20 11:51:09,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 188 events. 7/188 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 580 event pairs, 4 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 231. Up to 23 conditions per place. [2022-11-20 11:51:09,682 INFO L137 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2022-11-20 11:51:09,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow [2022-11-20 11:51:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-11-20 11:51:09,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-11-20 11:51:09,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-11-20 11:51:09,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-11-20 11:51:09,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:09,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-11-20 11:51:09,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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) [2022-11-20 11:51:09,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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) [2022-11-20 11:51:09,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 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) [2022-11-20 11:51:09,689 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions. [2022-11-20 11:51:09,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow [2022-11-20 11:51:09,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:51:09,693 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow [2022-11-20 11:51:09,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2022-11-20 11:51:09,694 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-20 11:51:09,695 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow [2022-11-20 11:51:09,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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) [2022-11-20 11:51:09,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:09,696 INFO L209 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] [2022-11-20 11:51:09,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:51:09,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-20 11:51:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 476877077, now seen corresponding path program 1 times [2022-11-20 11:51:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:09,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064532602] [2022-11-20 11:51:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:51:09,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:51:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:51:09,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:51:09,774 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:51:09,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-11-20 11:51:09,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-11-20 11:51:09,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-11-20 11:51:09,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-11-20 11:51:09,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-11-20 11:51:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-11-20 11:51:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-11-20 11:51:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-11-20 11:51:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-11-20 11:51:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-11-20 11:51:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-11-20 11:51:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-11-20 11:51:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-11-20 11:51:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-11-20 11:51:09,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:51:09,783 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-20 11:51:09,786 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 11:51:09,786 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-20 11:51:09,814 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 11:51:09,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow [2022-11-20 11:51:09,851 INFO L130 PetriNetUnfolder]: 18/209 cut-off events. [2022-11-20 11:51:09,851 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 11:51:09,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 209 events. 18/209 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 516 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-11-20 11:51:09,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow [2022-11-20 11:51:09,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow [2022-11-20 11:51:09,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:51:09,859 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b61f6ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:51:09,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-20 11:51:09,863 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-20 11:51:09,863 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:51:09,863 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:09,863 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:09,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-20 11:51:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1695734104, now seen corresponding path program 1 times [2022-11-20 11:51:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:09,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397505598] [2022-11-20 11:51:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:09,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:09,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397505598] [2022-11-20 11:51:09,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397505598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:09,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:09,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:51:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420106526] [2022-11-20 11:51:09,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:09,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:51:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:09,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:51:09,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:51:09,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-11-20 11:51:09,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 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) [2022-11-20 11:51:09,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:09,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-11-20 11:51:09,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:09,985 INFO L130 PetriNetUnfolder]: 16/208 cut-off events. [2022-11-20 11:51:09,986 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-11-20 11:51:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 208 events. 16/208 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 637 event pairs, 1 based on Foata normal form. 18/197 useless extension candidates. Maximal degree in co-relation 116. Up to 27 conditions per place. [2022-11-20 11:51:09,991 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2022-11-20 11:51:09,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow [2022-11-20 11:51:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:51:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 11:51:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-11-20 11:51:09,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2022-11-20 11:51:09,994 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2022-11-20 11:51:09,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2022-11-20 11:51:09,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:09,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2022-11-20 11:51:09,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 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) [2022-11-20 11:51:09,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2022-11-20 11:51:09,997 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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) [2022-11-20 11:51:09,998 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions. [2022-11-20 11:51:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow [2022-11-20 11:51:10,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:51:10,006 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow [2022-11-20 11:51:10,007 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=212, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2022-11-20 11:51:10,011 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2022-11-20 11:51:10,011 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow [2022-11-20 11:51:10,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 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) [2022-11-20 11:51:10,012 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:10,012 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:10,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:51:10,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-20 11:51:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -708223178, now seen corresponding path program 1 times [2022-11-20 11:51:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:10,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458048602] [2022-11-20 11:51:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:10,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:10,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458048602] [2022-11-20 11:51:10,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458048602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:10,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:10,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:51:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283069330] [2022-11-20 11:51:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:10,104 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-11-20 11:51:10,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2022-11-20 11:51:10,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:10,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-11-20 11:51:10,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:10,236 INFO L130 PetriNetUnfolder]: 68/423 cut-off events. [2022-11-20 11:51:10,236 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-20 11:51:10,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 423 events. 68/423 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2046 event pairs, 9 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 562. Up to 103 conditions per place. [2022-11-20 11:51:10,240 INFO L137 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-11-20 11:51:10,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow [2022-11-20 11:51:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-11-20 11:51:10,243 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2022-11-20 11:51:10,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-11-20 11:51:10,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-11-20 11:51:10,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:10,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-11-20 11:51:10,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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) [2022-11-20 11:51:10,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2022-11-20 11:51:10,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2022-11-20 11:51:10,247 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions. [2022-11-20 11:51:10,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow [2022-11-20 11:51:10,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:51:10,251 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow [2022-11-20 11:51:10,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2022-11-20 11:51:10,253 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places. [2022-11-20 11:51:10,253 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow [2022-11-20 11:51:10,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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) [2022-11-20 11:51:10,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:10,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:10,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:51:10,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-20 11:51:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -441666231, now seen corresponding path program 1 times [2022-11-20 11:51:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:10,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110487704] [2022-11-20 11:51:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110487704] [2022-11-20 11:51:10,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110487704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:10,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:10,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640127975] [2022-11-20 11:51:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:10,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:10,301 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-11-20 11:51:10,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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) [2022-11-20 11:51:10,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:10,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-11-20 11:51:10,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:10,477 INFO L130 PetriNetUnfolder]: 52/631 cut-off events. [2022-11-20 11:51:10,477 INFO L131 PetriNetUnfolder]: For 111/313 co-relation queries the response was YES. [2022-11-20 11:51:10,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 631 events. 52/631 cut-off events. For 111/313 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3968 event pairs, 10 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 780. Up to 52 conditions per place. [2022-11-20 11:51:10,483 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2022-11-20 11:51:10,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow [2022-11-20 11:51:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-11-20 11:51:10,485 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-20 11:51:10,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-11-20 11:51:10,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-11-20 11:51:10,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:10,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-11-20 11:51:10,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2022-11-20 11:51:10,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2022-11-20 11:51:10,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2022-11-20 11:51:10,489 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions. [2022-11-20 11:51:10,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow [2022-11-20 11:51:10,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:51:10,494 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow [2022-11-20 11:51:10,494 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2022-11-20 11:51:10,495 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2022-11-20 11:51:10,495 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow [2022-11-20 11:51:10,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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) [2022-11-20 11:51:10,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:10,496 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:10,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:51:10,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-20 11:51:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2101498532, now seen corresponding path program 1 times [2022-11-20 11:51:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:10,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760906608] [2022-11-20 11:51:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:10,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:10,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760906608] [2022-11-20 11:51:10,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760906608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:10,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:10,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:10,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349140365] [2022-11-20 11:51:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:10,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:10,543 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-11-20 11:51:10,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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) [2022-11-20 11:51:10,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:10,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-11-20 11:51:10,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:10,911 INFO L130 PetriNetUnfolder]: 266/1644 cut-off events. [2022-11-20 11:51:10,911 INFO L131 PetriNetUnfolder]: For 362/767 co-relation queries the response was YES. [2022-11-20 11:51:10,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1644 events. 266/1644 cut-off events. For 362/767 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13861 event pairs, 91 based on Foata normal form. 1/1398 useless extension candidates. Maximal degree in co-relation 2410. Up to 383 conditions per place. [2022-11-20 11:51:10,926 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2022-11-20 11:51:10,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow [2022-11-20 11:51:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-11-20 11:51:10,928 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-11-20 11:51:10,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-11-20 11:51:10,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-11-20 11:51:10,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:10,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-11-20 11:51:10,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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) [2022-11-20 11:51:10,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2022-11-20 11:51:10,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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) [2022-11-20 11:51:10,934 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions. [2022-11-20 11:51:10,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow [2022-11-20 11:51:10,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 117 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:51:10,946 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow [2022-11-20 11:51:10,946 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2022-11-20 11:51:10,948 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-11-20 11:51:10,948 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow [2022-11-20 11:51:10,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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) [2022-11-20 11:51:10,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:10,950 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:10,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:51:10,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-20 11:51:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash 210032464, now seen corresponding path program 1 times [2022-11-20 11:51:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:10,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713028935] [2022-11-20 11:51:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:11,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713028935] [2022-11-20 11:51:11,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713028935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:11,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816700390] [2022-11-20 11:51:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:11,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:11,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:11,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:51:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:11,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:51:11,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:11,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:11,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816700390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:11,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:11,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 11:51:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064531987] [2022-11-20 11:51:11,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:11,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:51:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:11,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:51:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:51:11,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-11-20 11:51:11,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 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) [2022-11-20 11:51:11,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:11,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-11-20 11:51:11,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:11,762 INFO L130 PetriNetUnfolder]: 196/645 cut-off events. [2022-11-20 11:51:11,762 INFO L131 PetriNetUnfolder]: For 427/570 co-relation queries the response was YES. [2022-11-20 11:51:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 645 events. 196/645 cut-off events. For 427/570 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4575 event pairs, 5 based on Foata normal form. 47/623 useless extension candidates. Maximal degree in co-relation 1409. Up to 156 conditions per place. [2022-11-20 11:51:11,770 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2022-11-20 11:51:11,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow [2022-11-20 11:51:11,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:51:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:51:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2022-11-20 11:51:11,775 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943 [2022-11-20 11:51:11,775 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2022-11-20 11:51:11,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2022-11-20 11:51:11,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:11,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2022-11-20 11:51:11,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 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) [2022-11-20 11:51:11,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 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) [2022-11-20 11:51:11,783 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 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) [2022-11-20 11:51:11,784 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions. [2022-11-20 11:51:11,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow [2022-11-20 11:51:11,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-20 11:51:11,790 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow [2022-11-20 11:51:11,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2022-11-20 11:51:11,792 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2022-11-20 11:51:11,792 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow [2022-11-20 11:51:11,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 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) [2022-11-20 11:51:11,793 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:11,794 INFO L209 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, 1, 1, 1, 1, 1] [2022-11-20 11:51:11,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:12,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:12,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-20 11:51:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 616978764, now seen corresponding path program 1 times [2022-11-20 11:51:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:12,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32991851] [2022-11-20 11:51:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:51:12,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:51:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:51:12,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:51:12,070 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:51:12,071 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2022-11-20 11:51:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2022-11-20 11:51:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2022-11-20 11:51:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2022-11-20 11:51:12,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2022-11-20 11:51:12,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2022-11-20 11:51:12,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2022-11-20 11:51:12,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2022-11-20 11:51:12,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2022-11-20 11:51:12,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2022-11-20 11:51:12,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2022-11-20 11:51:12,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2022-11-20 11:51:12,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2022-11-20 11:51:12,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2022-11-20 11:51:12,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2022-11-20 11:51:12,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2022-11-20 11:51:12,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2022-11-20 11:51:12,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2022-11-20 11:51:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:51:12,077 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-20 11:51:12,078 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-20 11:51:12,078 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-20 11:51:12,120 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 11:51:12,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow [2022-11-20 11:51:12,193 INFO L130 PetriNetUnfolder]: 34/360 cut-off events. [2022-11-20 11:51:12,193 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-20 11:51:12,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 360 events. 34/360 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1100 event pairs, 1 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-11-20 11:51:12,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow [2022-11-20 11:51:12,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow [2022-11-20 11:51:12,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:51:12,206 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b61f6ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:51:12,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-20 11:51:12,208 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-20 11:51:12,209 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:51:12,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:12,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:12,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -369850584, now seen corresponding path program 1 times [2022-11-20 11:51:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946505509] [2022-11-20 11:51:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:12,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:12,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946505509] [2022-11-20 11:51:12,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946505509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:12,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:12,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:51:12,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865767902] [2022-11-20 11:51:12,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:12,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:51:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:51:12,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:51:12,234 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128 [2022-11-20 11:51:12,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 286 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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) [2022-11-20 11:51:12,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:12,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128 [2022-11-20 11:51:12,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:12,335 INFO L130 PetriNetUnfolder]: 84/453 cut-off events. [2022-11-20 11:51:12,335 INFO L131 PetriNetUnfolder]: For 191/217 co-relation queries the response was YES. [2022-11-20 11:51:12,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 453 events. 84/453 cut-off events. For 191/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1934 event pairs, 19 based on Foata normal form. 57/450 useless extension candidates. Maximal degree in co-relation 317. Up to 115 conditions per place. [2022-11-20 11:51:12,341 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2022-11-20 11:51:12,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow [2022-11-20 11:51:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:51:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 11:51:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions. [2022-11-20 11:51:12,343 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.88671875 [2022-11-20 11:51:12,343 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions. [2022-11-20 11:51:12,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions. [2022-11-20 11:51:12,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:12,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions. [2022-11-20 11:51:12,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 113.5) internal successors, (227), 2 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) [2022-11-20 11:51:12,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2022-11-20 11:51:12,346 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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) [2022-11-20 11:51:12,346 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions. [2022-11-20 11:51:12,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow [2022-11-20 11:51:12,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:51:12,350 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow [2022-11-20 11:51:12,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2022-11-20 11:51:12,351 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2022-11-20 11:51:12,351 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow [2022-11-20 11:51:12,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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) [2022-11-20 11:51:12,352 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:12,352 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:12,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:51:12,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1058045878, now seen corresponding path program 1 times [2022-11-20 11:51:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:12,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333990083] [2022-11-20 11:51:12,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:12,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333990083] [2022-11-20 11:51:12,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333990083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:12,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:12,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:51:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470543811] [2022-11-20 11:51:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:12,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:12,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:12,392 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-20 11:51:12,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 260 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) [2022-11-20 11:51:12,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:12,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-20 11:51:12,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:12,650 INFO L130 PetriNetUnfolder]: 258/1209 cut-off events. [2022-11-20 11:51:12,650 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-20 11:51:12,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1209 events. 258/1209 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7790 event pairs, 58 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1666. Up to 347 conditions per place. [2022-11-20 11:51:12,667 INFO L137 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-11-20 11:51:12,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow [2022-11-20 11:51:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-11-20 11:51:12,669 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-11-20 11:51:12,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-11-20 11:51:12,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-11-20 11:51:12,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:12,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-11-20 11:51:12,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2022-11-20 11:51:12,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2022-11-20 11:51:12,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2022-11-20 11:51:12,673 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions. [2022-11-20 11:51:12,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow [2022-11-20 11:51:12,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:51:12,677 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow [2022-11-20 11:51:12,678 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2022-11-20 11:51:12,678 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places. [2022-11-20 11:51:12,679 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow [2022-11-20 11:51:12,679 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) [2022-11-20 11:51:12,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:12,679 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:12,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:51:12,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 836136859, now seen corresponding path program 1 times [2022-11-20 11:51:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:12,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790701338] [2022-11-20 11:51:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:12,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790701338] [2022-11-20 11:51:12,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790701338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:12,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:12,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:12,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185509682] [2022-11-20 11:51:12,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:12,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:12,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:12,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:12,716 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128 [2022-11-20 11:51:12,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 272 flow. Second operand has 3 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) [2022-11-20 11:51:12,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:12,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128 [2022-11-20 11:51:12,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:13,390 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 103#L721-2true, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:13,390 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-20 11:51:13,390 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-20 11:51:13,391 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-20 11:51:13,391 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-20 11:51:13,391 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-20 11:51:13,391 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:13,392 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 11:51:13,392 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:13,392 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-20 11:51:13,392 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 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_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][116], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 87#L721-3true, 126#true]) [2022-11-20 11:51:13,393 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:13,393 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:13,393 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-20 11:51:13,393 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 11:51:13,520 INFO L130 PetriNetUnfolder]: 654/3901 cut-off events. [2022-11-20 11:51:13,520 INFO L131 PetriNetUnfolder]: For 1338/3693 co-relation queries the response was YES. [2022-11-20 11:51:13,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 3901 events. 654/3901 cut-off events. For 1338/3693 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 39386 event pairs, 115 based on Foata normal form. 1/3144 useless extension candidates. Maximal degree in co-relation 5253. Up to 474 conditions per place. [2022-11-20 11:51:13,560 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2022-11-20 11:51:13,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow [2022-11-20 11:51:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-20 11:51:13,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2022-11-20 11:51:13,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-20 11:51:13,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-20 11:51:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:13,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-20 11:51:13,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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) [2022-11-20 11:51:13,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2022-11-20 11:51:13,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2022-11-20 11:51:13,566 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions. [2022-11-20 11:51:13,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow [2022-11-20 11:51:13,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:51:13,570 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow [2022-11-20 11:51:13,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2022-11-20 11:51:13,571 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-20 11:51:13,572 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow [2022-11-20 11:51:13,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-11-20 11:51:13,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:13,572 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:13,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:51:13,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1456596170, now seen corresponding path program 1 times [2022-11-20 11:51:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:13,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83493404] [2022-11-20 11:51:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:13,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83493404] [2022-11-20 11:51:13,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83493404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:13,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:13,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:51:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677708028] [2022-11-20 11:51:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:13,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:51:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:51:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:51:13,608 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128 [2022-11-20 11:51:13,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2022-11-20 11:51:13,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:13,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128 [2022-11-20 11:51:13,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:15,597 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 65#salethreadENTRYtrue, 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-20 11:51:15,597 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-20 11:51:15,597 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-20 11:51:15,598 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-20 11:51:15,598 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-20 11:51:15,804 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 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_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 41#L722-1true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:15,804 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-20 11:51:15,805 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-20 11:51:15,805 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-20 11:51:15,805 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-20 11:51:15,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 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_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 88#L722-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:15,806 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-20 11:51:15,806 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-20 11:51:15,806 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-20 11:51:15,806 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-20 11:51:15,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 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_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 126#true, 87#L721-3true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:15,839 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:15,839 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-20 11:51:15,840 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 11:51:15,840 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:16,079 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:16,080 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:16,080 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-20 11:51:16,080 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-20 11:51:16,081 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:16,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:16,353 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-20 11:51:16,353 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 11:51:16,354 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-20 11:51:16,354 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-20 11:51:16,381 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:16,382 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-20 11:51:16,382 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-20 11:51:16,382 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-20 11:51:16,383 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-20 11:51:16,383 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-20 11:51:16,383 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 106#L722-1true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:16,384 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-20 11:51:16,384 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-20 11:51:16,384 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-20 11:51:16,384 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-20 11:51:16,891 INFO L130 PetriNetUnfolder]: 4573/16387 cut-off events. [2022-11-20 11:51:16,891 INFO L131 PetriNetUnfolder]: For 6386/11701 co-relation queries the response was YES. [2022-11-20 11:51:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 16387 events. 4573/16387 cut-off events. For 6386/11701 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 201732 event pairs, 1391 based on Foata normal form. 3/13976 useless extension candidates. Maximal degree in co-relation 27135. Up to 4987 conditions per place. [2022-11-20 11:51:17,098 INFO L137 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2022-11-20 11:51:17,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow [2022-11-20 11:51:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:51:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:51:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-20 11:51:17,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-11-20 11:51:17,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-20 11:51:17,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-20 11:51:17,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:17,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-20 11:51:17,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2022-11-20 11:51:17,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2022-11-20 11:51:17,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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) [2022-11-20 11:51:17,105 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions. [2022-11-20 11:51:17,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow [2022-11-20 11:51:17,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:51:17,123 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow [2022-11-20 11:51:17,123 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=122, PETRI_TRANSITIONS=136} [2022-11-20 11:51:17,124 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-20 11:51:17,124 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow [2022-11-20 11:51:17,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2022-11-20 11:51:17,125 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:17,125 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:51:17,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -505216926, now seen corresponding path program 1 times [2022-11-20 11:51:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:17,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046387194] [2022-11-20 11:51:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:17,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046387194] [2022-11-20 11:51:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046387194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328160400] [2022-11-20 11:51:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:17,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:17,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:17,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:51:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:17,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:51:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:17,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:17,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328160400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:51:17,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:51:17,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 11:51:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778209185] [2022-11-20 11:51:17,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:51:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:51:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:51:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:51:17,513 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128 [2022-11-20 11:51:17,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 136 transitions, 426 flow. Second operand has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 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) [2022-11-20 11:51:17,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:17,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128 [2022-11-20 11:51:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:21,255 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][105], [146#true, Black: 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-20 11:51:21,255 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:21,255 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:21,255 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:21,255 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:21,256 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L728-->L721-3: Formula: (= (+ v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread2of3ForFork0_#t~nondet2=|v_salethreadThread2of3ForFork0_#t~nondet2_3|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread2of3ForFork0_#t~nondet2][106], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-20 11:51:21,256 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:21,256 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:21,256 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:21,256 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:21,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L749-6-->L752: Formula: (= |v_#race~numberOfSeatsSold~0_10| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_10|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][135], [Black: 140#true, 146#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0), 55#L752true]) [2022-11-20 11:51:21,447 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-11-20 11:51:21,447 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-20 11:51:21,447 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-20 11:51:21,447 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-20 11:51:21,547 INFO L130 PetriNetUnfolder]: 6176/24951 cut-off events. [2022-11-20 11:51:21,547 INFO L131 PetriNetUnfolder]: For 11078/13988 co-relation queries the response was YES. [2022-11-20 11:51:21,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43873 conditions, 24951 events. 6176/24951 cut-off events. For 11078/13988 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 336490 event pairs, 1529 based on Foata normal form. 160/21065 useless extension candidates. Maximal degree in co-relation 43863. Up to 3631 conditions per place. [2022-11-20 11:51:21,748 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions. [2022-11-20 11:51:21,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow [2022-11-20 11:51:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:51:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 11:51:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-11-20 11:51:21,752 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-11-20 11:51:21,752 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-11-20 11:51:21,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-11-20 11:51:21,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:21,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-11-20 11:51:21,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 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) [2022-11-20 11:51:21,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2022-11-20 11:51:21,759 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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) [2022-11-20 11:51:21,759 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions. [2022-11-20 11:51:21,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow [2022-11-20 11:51:21,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 188 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:51:21,868 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow [2022-11-20 11:51:21,869 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2022-11-20 11:51:21,870 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2022-11-20 11:51:21,871 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow [2022-11-20 11:51:21,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 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) [2022-11-20 11:51:21,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:21,872 INFO L209 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, 1, 1] [2022-11-20 11:51:21,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:51:22,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 11:51:22,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1053784385, now seen corresponding path program 1 times [2022-11-20 11:51:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:22,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732007009] [2022-11-20 11:51:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:22,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:51:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732007009] [2022-11-20 11:51:22,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732007009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:22,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:22,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:51:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479844003] [2022-11-20 11:51:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:22,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:51:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:51:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:51:22,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-20 11:51:22,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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) [2022-11-20 11:51:22,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:22,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-20 11:51:22,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:24,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 87#L721-3true, 5#L722-2true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-20 11:51:24,298 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-20 11:51:24,298 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-20 11:51:24,298 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 11:51:24,298 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-20 11:51:24,299 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, 76#L722-1true, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-20 11:51:24,299 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-20 11:51:24,299 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-20 11:51:24,299 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-20 11:51:24,299 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-20 11:51:24,304 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-2-->L723: Formula: (= v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1 v_~numberOfSeatsSold~0_1) InVars {~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1} OutVars{~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1, salethreadThread3of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1} AuxVars[] AssignedVars[salethreadThread3of3ForFork0_~_numberOfSeatsSold~0][136], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 20#L728true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, 39#L723true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-20 11:51:24,304 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-11-20 11:51:24,304 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-20 11:51:24,304 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-20 11:51:24,304 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-11-20 11:51:24,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 97#L721-3true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:24,570 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-20 11:51:24,570 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 11:51:24,570 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-20 11:51:24,571 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-20 11:51:25,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:25,451 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-20 11:51:25,451 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:25,452 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:25,452 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:25,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][175], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 20#L728true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:25,467 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-20 11:51:25,467 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-20 11:51:25,467 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-20 11:51:25,467 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-20 11:51:25,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 97#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:25,546 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:25,546 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-20 11:51:25,547 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:25,547 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:26,338 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-20 11:51:26,338 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-20 11:51:26,338 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 11:51:26,338 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 11:51:26,338 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 11:51:26,466 INFO L130 PetriNetUnfolder]: 7626/31979 cut-off events. [2022-11-20 11:51:26,466 INFO L131 PetriNetUnfolder]: For 7994/14839 co-relation queries the response was YES. [2022-11-20 11:51:26,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51791 conditions, 31979 events. 7626/31979 cut-off events. For 7994/14839 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 456014 event pairs, 2221 based on Foata normal form. 112/27121 useless extension candidates. Maximal degree in co-relation 51779. Up to 4756 conditions per place. [2022-11-20 11:51:26,755 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2022-11-20 11:51:26,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow [2022-11-20 11:51:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:51:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 11:51:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-11-20 11:51:26,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-20 11:51:26,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-11-20 11:51:26,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-11-20 11:51:26,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:26,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-11-20 11:51:26,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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) [2022-11-20 11:51:26,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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) [2022-11-20 11:51:26,764 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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) [2022-11-20 11:51:26,764 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions. [2022-11-20 11:51:26,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow [2022-11-20 11:51:26,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 797 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-20 11:51:26,776 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow [2022-11-20 11:51:26,776 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=137, PETRI_TRANSITIONS=148} [2022-11-20 11:51:26,778 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places. [2022-11-20 11:51:26,778 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow [2022-11-20 11:51:26,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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) [2022-11-20 11:51:26,779 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:26,779 INFO L209 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, 1, 1] [2022-11-20 11:51:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:51:26,780 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -213244023, now seen corresponding path program 1 times [2022-11-20 11:51:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975399720] [2022-11-20 11:51:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:51:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975399720] [2022-11-20 11:51:27,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975399720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:51:27,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:51:27,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:51:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785340972] [2022-11-20 11:51:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:51:27,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:51:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:51:27,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:51:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:51:27,117 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-20 11:51:27,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 148 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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) [2022-11-20 11:51:27,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:51:27,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-20 11:51:27,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:51:30,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), 97#L721-3true, Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:30,631 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-20 11:51:30,631 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-20 11:51:30,631 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:30,631 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-20 11:51:31,737 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 25), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-20 11:51:31,737 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-20 11:51:31,738 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 11:51:31,738 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-20 11:51:31,738 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-20 11:51:32,048 INFO L130 PetriNetUnfolder]: 7497/33079 cut-off events. [2022-11-20 11:51:32,050 INFO L131 PetriNetUnfolder]: For 16019/21826 co-relation queries the response was YES. [2022-11-20 11:51:32,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58016 conditions, 33079 events. 7497/33079 cut-off events. For 16019/21826 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 480047 event pairs, 2293 based on Foata normal form. 208/28502 useless extension candidates. Maximal degree in co-relation 58000. Up to 4780 conditions per place. [2022-11-20 11:51:32,328 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2022-11-20 11:51:32,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow [2022-11-20 11:51:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:51:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-20 11:51:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-11-20 11:51:32,331 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2022-11-20 11:51:32,333 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-11-20 11:51:32,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-11-20 11:51:32,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:51:32,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-11-20 11:51:32,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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) [2022-11-20 11:51:32,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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) [2022-11-20 11:51:32,348 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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) [2022-11-20 11:51:32,348 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions. [2022-11-20 11:51:32,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow [2022-11-20 11:51:32,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 186 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:51:32,396 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow [2022-11-20 11:51:32,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=143, PETRI_TRANSITIONS=152} [2022-11-20 11:51:32,398 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2022-11-20 11:51:32,398 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow [2022-11-20 11:51:32,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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) [2022-11-20 11:51:32,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:51:32,399 INFO L209 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, 1, 1, 1, 1, 1] [2022-11-20 11:51:32,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:51:32,400 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-20 11:51:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:51:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1287448103, now seen corresponding path program 1 times [2022-11-20 11:51:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:51:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507323080] [2022-11-20 11:51:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:51:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:51:32,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:51:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:51:32,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:51:32,459 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:51:32,460 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-20 11:51:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-20 11:51:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-20 11:51:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-20 11:51:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-20 11:51:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-20 11:51:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-20 11:51:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-20 11:51:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-20 11:51:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-20 11:51:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2022-11-20 11:51:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-11-20 11:51:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-11-20 11:51:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-20 11:51:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-20 11:51:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-20 11:51:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-20 11:51:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-20 11:51:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-20 11:51:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-20 11:51:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-20 11:51:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-20 11:51:32,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:51:32,465 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:51:32,472 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-20 11:51:32,473 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:51:32,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:51:32 BasicIcfg [2022-11-20 11:51:32,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:51:32,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:51:32,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:51:32,592 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:51:32,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:51:07" (3/4) ... [2022-11-20 11:51:32,598 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:51:32,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:51:32,599 INFO L158 Benchmark]: Toolchain (without parser) took 26191.49ms. Allocated memory was 172.0MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 140.2MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 785.7MB. Max. memory is 16.1GB. [2022-11-20 11:51:32,600 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 82.7MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:51:32,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.62ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 120.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 11:51:32,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.81ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:51:32,601 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 172.0MB. Free memory was 118.2MB in the beginning and 117.4MB in the end (delta: 882.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:51:32,601 INFO L158 Benchmark]: RCFGBuilder took 740.39ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 100.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 11:51:32,602 INFO L158 Benchmark]: TraceAbstraction took 24685.66ms. Allocated memory was 172.0MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 99.4MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 743.8MB. Max. memory is 16.1GB. [2022-11-20 11:51:32,602 INFO L158 Benchmark]: Witness Printer took 7.68ms. Allocated memory is still 7.2GB. Free memory is still 6.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:51:32,606 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 82.7MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.62ms. Allocated memory is still 172.0MB. Free memory was 140.2MB in the beginning and 120.3MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.81ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 172.0MB. Free memory was 118.2MB in the beginning and 117.4MB in the end (delta: 882.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 740.39ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 100.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24685.66ms. Allocated memory was 172.0MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 99.4MB in the beginning and 6.4GB in the end (delta: -6.3GB). Peak memory consumption was 743.8MB. Max. memory is 16.1GB. * Witness Printer took 7.68ms. Allocated memory is still 7.2GB. Free memory is still 6.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected 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 [numberOfSeatsSold=0, numOfTickets=0, stopSales=0] [L736] 0 pthread_t salethreads[25]; VAL [\old(argc)=101, argc=101, argv={102:103}, argv={102:103}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 25 VAL [\old(argc)=101, argc=101, argv={102:103}, argv={102:103}, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=101, argc=101, argv={102:103}, argv={102:103}, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=101, argc=101, argv={102:103}, argv={102:103}, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=101, argc=101, argv={102:103}, argv={102:103}, i=0, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(argc)=101, argc=101, argv={102:103}, argv={102:103}, i=0, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=101, arg={0:0}, argc=101, argv={102:103}, argv={102:103}, i=0, numberOfSeatsSold=0, numOfTickets=25, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0] [L746] 0 i++ VAL [\old(argc)=101, arg={0:0}, argc=101, argv={102:103}, argv={102:103}, i=1, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(argc)=101, arg={0:0}, argc=101, argv={102:103}, argv={102:103}, i=1, numberOfSeatsSold=0, numOfTickets=25, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=101, arg={0:0}, argc=101, argv={102:103}, argv={102:103}, i=1, numberOfSeatsSold=0, numOfTickets=25, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=0, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L721] 2 !stopSales VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (25 - (((25 / 10) == 0) ? 1 : (25 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=25, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=25, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=25, 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, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 100 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.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 9 mSDtfsCounter, 61 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=184occurred in iteration=0, 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.5s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 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, 117 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.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 21 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred 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, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 311 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 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, 134 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: 20.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 33 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred 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.7s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 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! [2022-11-20 11:51:32,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bfeb227-2940-4810-ae5a-fc988fb78738/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE