./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8 --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 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a --- 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-e04fb08 [2022-11-16 11:42:35,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:35,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:35,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:35,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:35,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:35,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:35,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:35,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:35,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:35,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:35,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:35,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:35,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:35,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:35,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:35,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:35,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:35,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:35,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:35,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:35,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:35,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:35,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:35,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:35,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:35,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:35,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:35,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:35,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:35,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:35,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:35,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:35,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:35,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:35,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:35,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:35,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:35,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:35,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:35,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:35,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:42:35,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:35,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:35,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:35,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:35,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:35,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:35,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:35,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:35,651 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:35,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:35,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:35,653 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:42:35,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:35,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:35,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:35,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:42:35,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:35,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:42:35,654 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:42:35,655 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:35,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:42:35,655 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:35,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:42:35,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:35,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:35,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:35,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:35,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:35,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:35,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:42:35,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:42:35,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:42:35,659 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:42:35,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:42:35,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:42:35,660 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_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/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_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8 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 -> 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a [2022-11-16 11:42:35,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:36,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:36,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:36,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:36,015 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:36,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-deagle/airline-10.i [2022-11-16 11:42:36,081 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/data/48e3e1c35/1b159b3d5b434075a2544cd521a1785a/FLAGbebd3bb3f [2022-11-16 11:42:36,658 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:36,658 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/sv-benchmarks/c/pthread-deagle/airline-10.i [2022-11-16 11:42:36,691 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/data/48e3e1c35/1b159b3d5b434075a2544cd521a1785a/FLAGbebd3bb3f [2022-11-16 11:42:36,952 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/data/48e3e1c35/1b159b3d5b434075a2544cd521a1785a [2022-11-16 11:42:36,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:36,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:36,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:36,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:36,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:36,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:36" (1/1) ... [2022-11-16 11:42:36,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f76ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:36, skipping insertion in model container [2022-11-16 11:42:36,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:36" (1/1) ... [2022-11-16 11:42:36,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:37,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:37,458 WARN L229 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_01d896df-98d1-4262-a1e3-25a88b7a7754/sv-benchmarks/c/pthread-deagle/airline-10.i[32101,32114] [2022-11-16 11:42:37,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:37,471 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:42:37,514 WARN L229 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_01d896df-98d1-4262-a1e3-25a88b7a7754/sv-benchmarks/c/pthread-deagle/airline-10.i[32101,32114] [2022-11-16 11:42:37,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:37,546 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:42:37,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37 WrapperNode [2022-11-16 11:42:37,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:37,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:37,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:42:37,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:42:37,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,589 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-16 11:42:37,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:37,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:42:37,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:42:37,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:42:37,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,632 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:42:37,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:42:37,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:42:37,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:42:37,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (1/1) ... [2022-11-16 11:42:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:37,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:37,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:42:37,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:42:37,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:42:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:42:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:42:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:42:37,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:42:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-11-16 11:42:37,727 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-11-16 11:42:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:42:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:42:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:42:37,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:42:37,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:42:37,729 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:42:37,868 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:42:37,870 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:42:38,189 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:42:38,266 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:42:38,266 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:42:38,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:38 BoogieIcfgContainer [2022-11-16 11:42:38,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:42:38,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:42:38,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:42:38,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:42:38,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:42:36" (1/3) ... [2022-11-16 11:42:38,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68955115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:38, skipping insertion in model container [2022-11-16 11:42:38,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:37" (2/3) ... [2022-11-16 11:42:38,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68955115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:38, skipping insertion in model container [2022-11-16 11:42:38,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:38" (3/3) ... [2022-11-16 11:42:38,281 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-10.i [2022-11-16 11:42:38,290 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:42:38,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:42:38,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 11:42:38,301 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:42:38,391 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 11:42:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow [2022-11-16 11:42:38,528 INFO L130 PetriNetUnfolder]: 9/119 cut-off events. [2022-11-16 11:42:38,528 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 11:42:38,539 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-16 11:42:38,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow [2022-11-16 11:42:38,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow [2022-11-16 11:42:38,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:38,577 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;@42ed9cd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:38,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-16 11:42:38,599 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-16 11:42:38,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:42:38,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:38,600 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-16 11:42:38,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-16 11:42:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1999147629, now seen corresponding path program 1 times [2022-11-16 11:42:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:38,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648304610] [2022-11-16 11:42:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:38,842 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-16 11:42:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648304610] [2022-11-16 11:42:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648304610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:38,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:38,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:42:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066277155] [2022-11-16 11:42:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:38,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:42:38,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:42:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:38,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-11-16 11:42:38,917 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-16 11:42:38,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:38,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-11-16 11:42:38,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:39,005 INFO L130 PetriNetUnfolder]: 3/106 cut-off events. [2022-11-16 11:42:39,006 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 11:42:39,006 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-16 11:42:39,008 INFO L137 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2022-11-16 11:42:39,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow [2022-11-16 11:42:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:42:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:42:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2022-11-16 11:42:39,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909 [2022-11-16 11:42:39,026 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions. [2022-11-16 11:42:39,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions. [2022-11-16 11:42:39,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:39,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions. [2022-11-16 11:42:39,039 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-16 11:42:39,047 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-16 11:42:39,048 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-16 11:42:39,050 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions. [2022-11-16 11:42:39,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow [2022-11-16 11:42:39,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:42:39,063 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2022-11-16 11:42:39,065 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-16 11:42:39,073 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2022-11-16 11:42:39,074 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2022-11-16 11:42:39,075 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-16 11:42:39,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:39,075 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-16 11:42:39,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:42:39,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-16 11:42:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash 676304161, now seen corresponding path program 1 times [2022-11-16 11:42:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:39,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221402051] [2022-11-16 11:42:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:39,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-16 11:42:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:39,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221402051] [2022-11-16 11:42:39,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221402051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:39,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:39,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340849023] [2022-11-16 11:42:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:39,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2022-11-16 11:42:39,242 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-16 11:42:39,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:39,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2022-11-16 11:42:39,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:39,345 INFO L130 PetriNetUnfolder]: 12/148 cut-off events. [2022-11-16 11:42:39,346 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:42:39,348 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-16 11:42:39,350 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-11-16 11:42:39,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow [2022-11-16 11:42:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-11-16 11:42:39,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-11-16 11:42:39,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-11-16 11:42:39,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-11-16 11:42:39,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:39,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-11-16 11:42:39,362 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-16 11:42:39,363 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-16 11:42:39,364 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-16 11:42:39,364 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions. [2022-11-16 11:42:39,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow [2022-11-16 11:42:39,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:42:39,368 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow [2022-11-16 11:42:39,369 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-16 11:42:39,370 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-16 11:42:39,370 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow [2022-11-16 11:42:39,370 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-16 11:42:39,371 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:39,371 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-16 11:42:39,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:42:39,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-16 11:42:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1440702948, now seen corresponding path program 1 times [2022-11-16 11:42:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:39,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928046942] [2022-11-16 11:42:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:39,466 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-16 11:42:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:39,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928046942] [2022-11-16 11:42:39,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928046942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:39,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:39,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463992760] [2022-11-16 11:42:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:39,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:39,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88 [2022-11-16 11:42:39,471 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-16 11:42:39,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:39,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88 [2022-11-16 11:42:39,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:39,518 INFO L130 PetriNetUnfolder]: 1/131 cut-off events. [2022-11-16 11:42:39,519 INFO L131 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2022-11-16 11:42:39,519 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-16 11:42:39,520 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-11-16 11:42:39,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow [2022-11-16 11:42:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-11-16 11:42:39,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758 [2022-11-16 11:42:39,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2022-11-16 11:42:39,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2022-11-16 11:42:39,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:39,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2022-11-16 11:42:39,524 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-16 11:42:39,525 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-16 11:42:39,525 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-16 11:42:39,525 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions. [2022-11-16 11:42:39,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow [2022-11-16 11:42:39,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:42:39,528 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow [2022-11-16 11:42:39,528 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-16 11:42:39,529 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2022-11-16 11:42:39,529 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow [2022-11-16 11:42:39,530 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-16 11:42:39,530 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:39,530 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-16 11:42:39,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:42:39,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-16 11:42:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 373619005, now seen corresponding path program 1 times [2022-11-16 11:42:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:39,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839376224] [2022-11-16 11:42:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:39,574 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-16 11:42:39,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:39,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839376224] [2022-11-16 11:42:39,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839376224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:39,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:39,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425522182] [2022-11-16 11:42:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:39,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:39,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2022-11-16 11:42:39,578 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-16 11:42:39,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:39,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2022-11-16 11:42:39,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:39,630 INFO L130 PetriNetUnfolder]: 7/188 cut-off events. [2022-11-16 11:42:39,630 INFO L131 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2022-11-16 11:42:39,631 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-16 11:42:39,632 INFO L137 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2022-11-16 11:42:39,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow [2022-11-16 11:42:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-11-16 11:42:39,634 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-11-16 11:42:39,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-11-16 11:42:39,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-11-16 11:42:39,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:39,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-11-16 11:42:39,635 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-16 11:42:39,636 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-16 11:42:39,637 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-16 11:42:39,637 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions. [2022-11-16 11:42:39,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow [2022-11-16 11:42:39,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:42:39,639 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow [2022-11-16 11:42:39,640 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-16 11:42:39,641 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-16 11:42:39,641 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow [2022-11-16 11:42:39,641 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-16 11:42:39,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:39,642 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-16 11:42:39,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:42:39,642 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-16 11:42:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1959545260, now seen corresponding path program 1 times [2022-11-16 11:42:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:39,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010309086] [2022-11-16 11:42:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:39,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:39,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:42:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:39,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:42:39,710 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:42:39,711 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-11-16 11:42:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-11-16 11:42:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-11-16 11:42:39,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-11-16 11:42:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-11-16 11:42:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-11-16 11:42:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-11-16 11:42:39,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-11-16 11:42:39,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-11-16 11:42:39,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-11-16 11:42:39,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-11-16 11:42:39,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-11-16 11:42:39,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-11-16 11:42:39,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-11-16 11:42:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:42:39,716 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-16 11:42:39,719 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:42:39,719 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 11:42:39,739 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 11:42:39,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow [2022-11-16 11:42:39,766 INFO L130 PetriNetUnfolder]: 18/209 cut-off events. [2022-11-16 11:42:39,766 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:42:39,768 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-16 11:42:39,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow [2022-11-16 11:42:39,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow [2022-11-16 11:42:39,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:39,772 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;@42ed9cd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:39,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-16 11:42:39,775 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-16 11:42:39,775 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:42:39,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:39,775 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-16 11:42:39,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 11:42:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -746215681, now seen corresponding path program 1 times [2022-11-16 11:42:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:39,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59286860] [2022-11-16 11:42:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:39,794 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-16 11:42:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59286860] [2022-11-16 11:42:39,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59286860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:39,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:39,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:42:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303856895] [2022-11-16 11:42:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:39,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:42:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:42:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:39,797 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-11-16 11:42:39,797 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-16 11:42:39,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:39,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-11-16 11:42:39,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:39,857 INFO L130 PetriNetUnfolder]: 16/208 cut-off events. [2022-11-16 11:42:39,859 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-11-16 11:42:39,861 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 642 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-16 11:42:39,862 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2022-11-16 11:42:39,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow [2022-11-16 11:42:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:42:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:42:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-11-16 11:42:39,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2022-11-16 11:42:39,864 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2022-11-16 11:42:39,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2022-11-16 11:42:39,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:39,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2022-11-16 11:42:39,866 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-16 11:42:39,866 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-16 11:42:39,867 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-16 11:42:39,867 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions. [2022-11-16 11:42:39,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow [2022-11-16 11:42:39,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:42:39,872 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow [2022-11-16 11:42:39,873 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-16 11:42:39,877 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2022-11-16 11:42:39,877 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow [2022-11-16 11:42:39,877 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-16 11:42:39,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:39,878 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-16 11:42:39,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:42:39,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 11:42:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1859938163, now seen corresponding path program 1 times [2022-11-16 11:42:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:39,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85672741] [2022-11-16 11:42:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:39,947 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-16 11:42:39,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:39,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85672741] [2022-11-16 11:42:39,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85672741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:39,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:39,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246946490] [2022-11-16 11:42:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:39,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:39,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-11-16 11:42:39,950 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-16 11:42:39,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:39,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-11-16 11:42:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:40,041 INFO L130 PetriNetUnfolder]: 68/423 cut-off events. [2022-11-16 11:42:40,041 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 11:42:40,043 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 2061 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-16 11:42:40,045 INFO L137 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-11-16 11:42:40,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow [2022-11-16 11:42:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-11-16 11:42:40,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2022-11-16 11:42:40,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-11-16 11:42:40,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-11-16 11:42:40,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:40,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-11-16 11:42:40,048 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-16 11:42:40,049 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-16 11:42:40,050 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-16 11:42:40,050 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions. [2022-11-16 11:42:40,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow [2022-11-16 11:42:40,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:42:40,053 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow [2022-11-16 11:42:40,053 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-16 11:42:40,054 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places. [2022-11-16 11:42:40,054 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow [2022-11-16 11:42:40,054 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-16 11:42:40,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:40,054 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-16 11:42:40,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:42:40,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 11:42:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1310943378, now seen corresponding path program 1 times [2022-11-16 11:42:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:40,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360961729] [2022-11-16 11:42:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:40,085 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-16 11:42:40,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:40,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360961729] [2022-11-16 11:42:40,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360961729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:40,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:40,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709583739] [2022-11-16 11:42:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:40,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-11-16 11:42:40,088 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-16 11:42:40,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:40,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-11-16 11:42:40,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:40,222 INFO L130 PetriNetUnfolder]: 52/631 cut-off events. [2022-11-16 11:42:40,223 INFO L131 PetriNetUnfolder]: For 111/313 co-relation queries the response was YES. [2022-11-16 11:42:40,225 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 3962 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-16 11:42:40,227 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2022-11-16 11:42:40,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow [2022-11-16 11:42:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-11-16 11:42:40,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-16 11:42:40,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-11-16 11:42:40,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-11-16 11:42:40,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:40,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-11-16 11:42:40,231 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-16 11:42:40,232 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-16 11:42:40,232 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-16 11:42:40,233 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions. [2022-11-16 11:42:40,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow [2022-11-16 11:42:40,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:42:40,236 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow [2022-11-16 11:42:40,237 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-16 11:42:40,237 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2022-11-16 11:42:40,238 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow [2022-11-16 11:42:40,238 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-16 11:42:40,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:40,238 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-16 11:42:40,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:42:40,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 11:42:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 176942779, now seen corresponding path program 1 times [2022-11-16 11:42:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137022327] [2022-11-16 11:42:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:40,273 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-16 11:42:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137022327] [2022-11-16 11:42:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137022327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:40,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:40,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074829761] [2022-11-16 11:42:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:40,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:40,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:40,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:40,277 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-11-16 11:42:40,277 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-16 11:42:40,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:40,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-11-16 11:42:40,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:40,591 INFO L130 PetriNetUnfolder]: 266/1659 cut-off events. [2022-11-16 11:42:40,591 INFO L131 PetriNetUnfolder]: For 362/767 co-relation queries the response was YES. [2022-11-16 11:42:40,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1659 events. 266/1659 cut-off events. For 362/767 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14100 event pairs, 91 based on Foata normal form. 1/1410 useless extension candidates. Maximal degree in co-relation 2425. Up to 383 conditions per place. [2022-11-16 11:42:40,601 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2022-11-16 11:42:40,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow [2022-11-16 11:42:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-11-16 11:42:40,603 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-11-16 11:42:40,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-11-16 11:42:40,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-11-16 11:42:40,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:40,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-11-16 11:42:40,604 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-16 11:42:40,605 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-16 11:42:40,606 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-16 11:42:40,606 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions. [2022-11-16 11:42:40,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow [2022-11-16 11:42:40,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 117 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:42:40,610 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow [2022-11-16 11:42:40,610 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-16 11:42:40,611 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-11-16 11:42:40,611 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow [2022-11-16 11:42:40,612 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-16 11:42:40,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:40,612 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-16 11:42:40,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:42:40,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 11:42:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1184394343, now seen corresponding path program 1 times [2022-11-16 11:42:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:40,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681668966] [2022-11-16 11:42:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:40,741 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-16 11:42:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:40,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681668966] [2022-11-16 11:42:40,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681668966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:40,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156496381] [2022-11-16 11:42:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:40,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:40,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:42:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:40,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:42:40,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:40,910 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-16 11:42:40,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:40,957 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-16 11:42:40,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156496381] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:40,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:40,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:42:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297067018] [2022-11-16 11:42:40,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:40,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:42:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:42:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:42:40,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-11-16 11:42:40,961 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-16 11:42:40,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:40,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-11-16 11:42:40,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:41,181 INFO L130 PetriNetUnfolder]: 196/645 cut-off events. [2022-11-16 11:42:41,182 INFO L131 PetriNetUnfolder]: For 445/620 co-relation queries the response was YES. [2022-11-16 11:42:41,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 645 events. 196/645 cut-off events. For 445/620 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4598 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-16 11:42:41,187 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2022-11-16 11:42:41,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow [2022-11-16 11:42:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:42:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:42:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2022-11-16 11:42:41,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943 [2022-11-16 11:42:41,190 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2022-11-16 11:42:41,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2022-11-16 11:42:41,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:41,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2022-11-16 11:42:41,193 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-16 11:42:41,195 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-16 11:42:41,196 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-16 11:42:41,196 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions. [2022-11-16 11:42:41,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow [2022-11-16 11:42:41,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-16 11:42:41,200 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow [2022-11-16 11:42:41,201 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-16 11:42:41,201 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2022-11-16 11:42:41,202 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow [2022-11-16 11:42:41,202 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-16 11:42:41,202 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:41,203 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-16 11:42:41,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:42:41,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:41,408 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-16 11:42:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash 96829731, now seen corresponding path program 1 times [2022-11-16 11:42:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:41,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588180848] [2022-11-16 11:42:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:41,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:42:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:41,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:42:41,442 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:42:41,442 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2022-11-16 11:42:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2022-11-16 11:42:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2022-11-16 11:42:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2022-11-16 11:42:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2022-11-16 11:42:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2022-11-16 11:42:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2022-11-16 11:42:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2022-11-16 11:42:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2022-11-16 11:42:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2022-11-16 11:42:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2022-11-16 11:42:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2022-11-16 11:42:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2022-11-16 11:42:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2022-11-16 11:42:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2022-11-16 11:42:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2022-11-16 11:42:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2022-11-16 11:42:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2022-11-16 11:42:41,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:42:41,446 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 11:42:41,447 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 11:42:41,447 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 11:42:41,475 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:42:41,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow [2022-11-16 11:42:41,531 INFO L130 PetriNetUnfolder]: 34/360 cut-off events. [2022-11-16 11:42:41,531 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 11:42:41,534 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 1103 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-16 11:42:41,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow [2022-11-16 11:42:41,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow [2022-11-16 11:42:41,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:41,545 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;@42ed9cd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:41,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-16 11:42:41,551 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-16 11:42:41,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:42:41,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:41,552 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-16 11:42:41,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash 579667839, now seen corresponding path program 1 times [2022-11-16 11:42:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:41,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351124395] [2022-11-16 11:42:41,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:41,567 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-16 11:42:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:41,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351124395] [2022-11-16 11:42:41,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351124395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:41,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:41,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:42:41,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172675702] [2022-11-16 11:42:41,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:42:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:42:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:41,570 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128 [2022-11-16 11:42:41,570 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-16 11:42:41,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:41,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128 [2022-11-16 11:42:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:41,652 INFO L130 PetriNetUnfolder]: 84/453 cut-off events. [2022-11-16 11:42:41,652 INFO L131 PetriNetUnfolder]: For 191/217 co-relation queries the response was YES. [2022-11-16 11:42:41,655 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 1922 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-16 11:42:41,658 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2022-11-16 11:42:41,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow [2022-11-16 11:42:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:42:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 11:42:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions. [2022-11-16 11:42:41,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.88671875 [2022-11-16 11:42:41,668 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions. [2022-11-16 11:42:41,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions. [2022-11-16 11:42:41,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:41,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions. [2022-11-16 11:42:41,669 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-16 11:42:41,670 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-16 11:42:41,671 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-16 11:42:41,672 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions. [2022-11-16 11:42:41,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow [2022-11-16 11:42:41,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:42:41,675 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow [2022-11-16 11:42:41,676 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-16 11:42:41,677 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2022-11-16 11:42:41,677 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow [2022-11-16 11:42:41,678 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-16 11:42:41,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:41,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] [2022-11-16 11:42:41,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:42:41,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash -93669107, now seen corresponding path program 1 times [2022-11-16 11:42:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:41,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936989117] [2022-11-16 11:42:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:41,721 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-16 11:42:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936989117] [2022-11-16 11:42:41,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936989117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:41,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:41,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:41,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218964739] [2022-11-16 11:42:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:41,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:41,724 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-16 11:42:41,725 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-16 11:42:41,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:41,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-16 11:42:41,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:41,946 INFO L130 PetriNetUnfolder]: 258/1209 cut-off events. [2022-11-16 11:42:41,946 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-16 11:42:41,953 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 7825 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-16 11:42:41,961 INFO L137 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-11-16 11:42:41,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow [2022-11-16 11:42:41,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-11-16 11:42:41,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-11-16 11:42:41,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-11-16 11:42:41,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-11-16 11:42:41,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:41,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-11-16 11:42:41,965 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-16 11:42:41,966 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-16 11:42:41,966 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-16 11:42:41,967 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions. [2022-11-16 11:42:41,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow [2022-11-16 11:42:41,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:42:41,970 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow [2022-11-16 11:42:41,970 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-16 11:42:41,972 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places. [2022-11-16 11:42:41,972 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow [2022-11-16 11:42:41,972 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-16 11:42:41,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:41,973 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-16 11:42:41,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:42:41,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1706220828, now seen corresponding path program 1 times [2022-11-16 11:42:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:41,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675197953] [2022-11-16 11:42:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:41,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:42,014 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-16 11:42:42,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:42,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675197953] [2022-11-16 11:42:42,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675197953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:42,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:42,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423337751] [2022-11-16 11:42:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:42,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:42,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128 [2022-11-16 11:42:42,019 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-16 11:42:42,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:42,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128 [2022-11-16 11:42:42,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:42,672 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), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 103#L721-2true, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-16 11:42:42,673 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-16 11:42:42,673 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-16 11:42:42,673 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-16 11:42:42,673 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 11:42:42,673 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], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-16 11:42:42,674 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:42,674 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:42:42,674 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:42,674 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 11:42:42,675 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], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 87#L721-3true, 126#true]) [2022-11-16 11:42:42,675 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:42,675 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:42,675 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 11:42:42,675 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:42:42,716 INFO L130 PetriNetUnfolder]: 654/3901 cut-off events. [2022-11-16 11:42:42,716 INFO L131 PetriNetUnfolder]: For 1338/3693 co-relation queries the response was YES. [2022-11-16 11:42:42,733 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 39293 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-16 11:42:42,754 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2022-11-16 11:42:42,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow [2022-11-16 11:42:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-16 11:42:42,756 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2022-11-16 11:42:42,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-16 11:42:42,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-16 11:42:42,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:42,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-16 11:42:42,758 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-16 11:42:42,759 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-16 11:42:42,759 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-16 11:42:42,759 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions. [2022-11-16 11:42:42,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow [2022-11-16 11:42:42,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:42:42,764 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow [2022-11-16 11:42:42,765 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-16 11:42:42,766 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-16 11:42:42,766 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow [2022-11-16 11:42:42,766 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-16 11:42:42,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:42,766 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-16 11:42:42,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:42:42,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 913815373, now seen corresponding path program 1 times [2022-11-16 11:42:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:42,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401834724] [2022-11-16 11:42:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:42,801 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-16 11:42:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:42,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401834724] [2022-11-16 11:42:42,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401834724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:42,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:42,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966494120] [2022-11-16 11:42:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:42,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:42,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128 [2022-11-16 11:42:42,806 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-16 11:42:42,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:42,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128 [2022-11-16 11:42:42,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:44,506 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), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 66#salethreadENTRYtrue, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-16 11:42:44,506 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-16 11:42:44,506 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-16 11:42:44,507 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 11:42:44,507 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:42:44,690 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), 42#L722-1true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:44,690 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-16 11:42:44,691 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 11:42:44,691 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-16 11:42:44,691 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-16 11:42:44,691 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), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L722-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:44,692 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-16 11:42:44,692 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 11:42:44,692 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-16 11:42:44,692 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-16 11:42:44,720 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], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 126#true, 87#L721-3true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:44,721 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:44,721 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 11:42:44,721 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:42:44,721 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:44,883 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], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:44,883 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:44,883 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 11:42:44,884 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 11:42:44,884 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:45,051 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), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:45,052 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-16 11:42:45,052 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:42:45,052 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 11:42:45,052 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-16 11:42:45,069 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), 33#L750-7true, 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)]) [2022-11-16 11:42:45,070 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-16 11:42:45,070 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 11:42:45,070 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 11:42:45,070 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-16 11:42:45,071 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-16 11:42:45,071 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, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:45,071 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-16 11:42:45,071 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-16 11:42:45,071 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 11:42:45,072 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:42:45,524 INFO L130 PetriNetUnfolder]: 4573/16387 cut-off events. [2022-11-16 11:42:45,525 INFO L131 PetriNetUnfolder]: For 6386/11701 co-relation queries the response was YES. [2022-11-16 11:42:45,615 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 201725 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-16 11:42:45,704 INFO L137 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2022-11-16 11:42:45,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow [2022-11-16 11:42:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:42:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-16 11:42:45,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-11-16 11:42:45,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-16 11:42:45,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-16 11:42:45,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:45,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-16 11:42:45,709 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-16 11:42:45,712 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-16 11:42:45,712 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-16 11:42:45,713 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions. [2022-11-16 11:42:45,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow [2022-11-16 11:42:45,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:42:45,734 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow [2022-11-16 11:42:45,735 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-16 11:42:45,736 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-16 11:42:45,737 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow [2022-11-16 11:42:45,737 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-16 11:42:45,737 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:45,737 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-16 11:42:45,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:42:45,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 469144953, now seen corresponding path program 1 times [2022-11-16 11:42:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:45,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743191159] [2022-11-16 11:42:45,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:45,876 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-16 11:42:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:45,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743191159] [2022-11-16 11:42:45,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743191159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:45,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535538131] [2022-11-16 11:42:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:45,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:45,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:45,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:42:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:45,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:42:45,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:46,043 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-16 11:42:46,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:46,114 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-16 11:42:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535538131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:46,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:42:46,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:42:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934581809] [2022-11-16 11:42:46,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:46,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:42:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:46,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:42:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:42:46,120 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128 [2022-11-16 11:42:46,122 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-16 11:42:46,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:46,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128 [2022-11-16 11:42:46,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:49,451 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][108], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-16 11:42:49,451 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:49,451 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:49,452 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:49,452 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:49,452 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][106], [Black: 140#true, 146#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:49,452 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:49,452 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:49,452 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:49,453 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:49,532 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, 56#L752true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-16 11:42:49,532 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-11-16 11:42:49,532 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-16 11:42:49,532 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-16 11:42:49,533 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-16 11:42:49,612 INFO L130 PetriNetUnfolder]: 6176/24951 cut-off events. [2022-11-16 11:42:49,612 INFO L131 PetriNetUnfolder]: For 11078/13988 co-relation queries the response was YES. [2022-11-16 11:42:49,714 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 336576 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-16 11:42:49,820 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions. [2022-11-16 11:42:49,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow [2022-11-16 11:42:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:42:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:42:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-11-16 11:42:49,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-11-16 11:42:49,824 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-11-16 11:42:49,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-11-16 11:42:49,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:49,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-11-16 11:42:49,827 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-16 11:42:49,830 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-16 11:42:49,831 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-16 11:42:49,831 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions. [2022-11-16 11:42:49,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow [2022-11-16 11:42:49,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 188 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:42:49,925 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow [2022-11-16 11:42:49,926 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-16 11:42:49,926 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2022-11-16 11:42:49,927 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow [2022-11-16 11:42:49,927 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-16 11:42:49,927 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:49,928 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-16 11:42:49,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:50,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:50,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -593229992, now seen corresponding path program 1 times [2022-11-16 11:42:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692582959] [2022-11-16 11:42:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:50,271 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-16 11:42:50,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692582959] [2022-11-16 11:42:50,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692582959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:50,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:50,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:42:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821505389] [2022-11-16 11:42:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:50,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:42:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:50,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:42:50,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:42:50,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-16 11:42:50,275 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-16 11:42:50,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:50,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-16 11:42:50,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:52,254 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:52,254 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-16 11:42:52,254 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-16 11:42:52,254 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-16 11:42:52,255 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-16 11:42:52,255 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:52,255 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-16 11:42:52,255 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-16 11:42:52,255 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 11:42:52,255 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 11:42:52,260 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, 40#L723true, salethreadThread1of3ForFork0InUse, 21#L728true, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-16 11:42:52,260 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-11-16 11:42:52,260 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 11:42:52,260 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 11:42:52,260 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-11-16 11:42:52,407 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:52,407 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-16 11:42:52,408 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-16 11:42:52,408 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-16 11:42:52,408 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 11:42:53,330 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:53,330 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-16 11:42:53,331 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:53,331 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:53,331 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:53,343 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 21#L728true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-16 11:42:53,343 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-16 11:42:53,344 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 11:42:53,344 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 11:42:53,344 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 11:42:53,421 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:53,421 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:53,422 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-16 11:42:53,422 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:53,422 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:54,086 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| 10), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-16 11:42:54,086 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 11:42:54,086 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:42:54,086 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 11:42:54,086 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 11:42:54,167 INFO L130 PetriNetUnfolder]: 7626/31979 cut-off events. [2022-11-16 11:42:54,167 INFO L131 PetriNetUnfolder]: For 7994/14839 co-relation queries the response was YES. [2022-11-16 11:42:54,285 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 455850 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-16 11:42:54,404 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2022-11-16 11:42:54,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow [2022-11-16 11:42:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:42:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:42:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-11-16 11:42:54,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-16 11:42:54,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-11-16 11:42:54,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-11-16 11:42:54,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:54,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-11-16 11:42:54,408 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-16 11:42:54,409 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-16 11:42:54,410 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-16 11:42:54,410 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions. [2022-11-16 11:42:54,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow [2022-11-16 11:42:54,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 797 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-16 11:42:54,417 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow [2022-11-16 11:42:54,417 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-16 11:42:54,418 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places. [2022-11-16 11:42:54,418 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow [2022-11-16 11:42:54,418 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-16 11:42:54,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:54,419 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-16 11:42:54,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:42:54,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1860258400, now seen corresponding path program 1 times [2022-11-16 11:42:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:54,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587238988] [2022-11-16 11:42:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:54,477 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-16 11:42:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:54,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587238988] [2022-11-16 11:42:54,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587238988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:54,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:54,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:42:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041104700] [2022-11-16 11:42:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:54,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:42:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:42:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:42:54,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-16 11:42:54,481 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-16 11:42:54,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:42:54,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-16 11:42:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:42:57,257 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| 10), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:57,257 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:42:57,257 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:42:57,257 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:57,258 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:42:58,177 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| 10), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 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-16 11:42:58,178 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 11:42:58,178 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:42:58,178 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 11:42:58,178 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 11:42:58,272 INFO L130 PetriNetUnfolder]: 7497/33079 cut-off events. [2022-11-16 11:42:58,272 INFO L131 PetriNetUnfolder]: For 16027/21821 co-relation queries the response was YES. [2022-11-16 11:42:58,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58016 conditions, 33079 events. 7497/33079 cut-off events. For 16027/21821 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 479988 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-16 11:42:58,496 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2022-11-16 11:42:58,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow [2022-11-16 11:42:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:42:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:42:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-11-16 11:42:58,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2022-11-16 11:42:58,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-11-16 11:42:58,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-11-16 11:42:58,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:42:58,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-11-16 11:42:58,500 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-16 11:42:58,502 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-16 11:42:58,502 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-16 11:42:58,503 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions. [2022-11-16 11:42:58,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow [2022-11-16 11:42:58,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 186 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:42:58,539 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow [2022-11-16 11:42:58,539 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-16 11:42:58,540 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2022-11-16 11:42:58,540 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow [2022-11-16 11:42:58,540 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-16 11:42:58,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:42:58,541 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-16 11:42:58,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:42:58,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 11:42:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash -871650852, now seen corresponding path program 1 times [2022-11-16 11:42:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:58,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263769511] [2022-11-16 11:42:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:58,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:42:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:58,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:42:58,569 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:42:58,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-16 11:42:58,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-16 11:42:58,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-16 11:42:58,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-16 11:42:58,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-16 11:42:58,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-16 11:42:58,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-16 11:42:58,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-16 11:42:58,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-16 11:42:58,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-16 11:42:58,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2022-11-16 11:42:58,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-11-16 11:42:58,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-11-16 11:42:58,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-16 11:42:58,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-16 11:42:58,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-16 11:42:58,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-16 11:42:58,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-16 11:42:58,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-16 11:42:58,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-16 11:42:58,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-16 11:42:58,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-16 11:42:58,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:42:58,574 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:58,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-16 11:42:58,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:42:58,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:42:58 BasicIcfg [2022-11-16 11:42:58,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:42:58,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:42:58,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:42:58,667 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:42:58,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:38" (3/4) ... [2022-11-16 11:42:58,670 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:42:58,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:42:58,671 INFO L158 Benchmark]: Toolchain (without parser) took 21712.50ms. Allocated memory was 98.6MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 76.5MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 990.9MB. Max. memory is 16.1GB. [2022-11-16 11:42:58,672 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 72.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:42:58,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.56ms. Allocated memory is still 98.6MB. Free memory was 76.1MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:42:58,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.09ms. Allocated memory is still 98.6MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:42:58,673 INFO L158 Benchmark]: Boogie Preprocessor took 56.00ms. Allocated memory is still 98.6MB. Free memory was 62.1MB in the beginning and 60.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:42:58,674 INFO L158 Benchmark]: RCFGBuilder took 621.65ms. Allocated memory is still 98.6MB. Free memory was 60.5MB in the beginning and 44.0MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 11:42:58,674 INFO L158 Benchmark]: TraceAbstraction took 20395.48ms. Allocated memory was 98.6MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 43.4MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 959.1MB. Max. memory is 16.1GB. [2022-11-16 11:42:58,674 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 6.0GB. Free memory is still 5.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:42:58,677 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.23ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 72.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.56ms. Allocated memory is still 98.6MB. Free memory was 76.1MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.09ms. Allocated memory is still 98.6MB. Free memory was 64.1MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.00ms. Allocated memory is still 98.6MB. Free memory was 62.1MB in the beginning and 60.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 621.65ms. Allocated memory is still 98.6MB. Free memory was 60.5MB in the beginning and 44.0MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20395.48ms. Allocated memory was 98.6MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 43.4MB in the beginning and 5.0GB in the end (delta: -4.9GB). Peak memory consumption was 959.1MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 6.0GB. Free memory is still 5.0GB. 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: [L718] 0 int stopSales; VAL [stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, stopSales=0] [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0, numOfTickets=0, stopSales=0] [L736] 0 pthread_t salethreads[10]; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 10 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 10 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=10, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0] [L746] 0 i++ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 10 VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=10, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=0, salethreads={3:0}, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (10 - (((10 / 10) == 0) ? 1 : (10 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=10, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=10, 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.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, 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.3s 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: 1.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.1s 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.3s 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: 17.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.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.5s 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-16 11:42:58,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01d896df-98d1-4262-a1e3-25a88b7a7754/bin/uautomizer-tPACEb0tL8/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