./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-5.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_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/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_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/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_094294d4-8cb1-4eee-803e-c9d14a20a16b/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 b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 --- 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 12:50:23,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:50:23,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:50:23,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:50:23,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:50:23,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:50:23,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:50:23,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:50:23,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:50:23,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:50:23,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:50:23,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:50:23,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:50:23,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:50:23,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:50:23,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:50:23,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:50:23,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:50:23,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:50:23,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:50:23,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:50:23,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:50:23,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:50:23,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:50:23,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:50:23,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:50:23,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:50:23,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:50:23,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:50:23,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:50:23,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:50:23,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:50:23,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:50:23,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:50:23,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:50:23,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:50:23,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:50:23,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:50:23,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:50:23,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:50:23,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:50:23,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:50:23,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:50:23,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:50:23,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:50:23,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:50:23,295 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:50:23,295 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:50:23,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:50:23,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:50:23,296 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:50:23,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:50:23,297 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:50:23,297 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:50:23,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:50:23,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:50:23,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:50:23,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:50:23,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:50:23,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:50:23,299 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:50:23,299 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:50:23,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:50:23,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:50:23,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:50:23,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:50:23,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:50:23,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:50:23,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:23,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:50:23,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:50:23,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:50:23,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:50:23,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:50:23,302 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:50:23,302 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:50:23,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:50:23,302 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_094294d4-8cb1-4eee-803e-c9d14a20a16b/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_094294d4-8cb1-4eee-803e-c9d14a20a16b/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 -> b3375d634339bd0477387b7559c4eae5ae554f112c0f1d9d1b21e4edc4514353 [2022-11-16 12:50:23,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:50:23,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:50:23,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:50:23,672 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:50:23,673 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:50:23,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-deagle/airline-5.i [2022-11-16 12:50:23,778 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/data/e9e61e085/c956190ebc994cff85d620368f709ffa/FLAG55fbe0c8c [2022-11-16 12:50:24,524 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:50:24,525 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/sv-benchmarks/c/pthread-deagle/airline-5.i [2022-11-16 12:50:24,541 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/data/e9e61e085/c956190ebc994cff85d620368f709ffa/FLAG55fbe0c8c [2022-11-16 12:50:24,789 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/data/e9e61e085/c956190ebc994cff85d620368f709ffa [2022-11-16 12:50:24,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:50:24,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:50:24,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:24,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:50:24,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:50:24,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:24" (1/1) ... [2022-11-16 12:50:24,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dec56e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:24, skipping insertion in model container [2022-11-16 12:50:24,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:50:24" (1/1) ... [2022-11-16 12:50:24,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:50:24,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:50:25,440 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_094294d4-8cb1-4eee-803e-c9d14a20a16b/sv-benchmarks/c/pthread-deagle/airline-5.i[32089,32102] [2022-11-16 12:50:25,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:25,450 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:50:25,492 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_094294d4-8cb1-4eee-803e-c9d14a20a16b/sv-benchmarks/c/pthread-deagle/airline-5.i[32089,32102] [2022-11-16 12:50:25,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:50:25,532 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:50:25,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25 WrapperNode [2022-11-16 12:50:25,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:50:25,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:25,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:50:25,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:50:25,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,583 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-16 12:50:25,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:50:25,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:50:25,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:50:25,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:50:25,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,614 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:50:25,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:50:25,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:50:25,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:50:25,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (1/1) ... [2022-11-16 12:50:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:50:25,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:25,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:50:25,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:50:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:50:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:50:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:50:25,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:50:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:50:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-11-16 12:50:25,743 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-11-16 12:50:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:50:25,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:50:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:50:25,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:50:25,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:50:25,746 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 12:50:25,929 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:50:25,932 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:50:26,307 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:50:26,379 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:50:26,379 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 12:50:26,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:26 BoogieIcfgContainer [2022-11-16 12:50:26,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:50:26,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:50:26,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:50:26,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:50:26,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:50:24" (1/3) ... [2022-11-16 12:50:26,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556a6c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:26, skipping insertion in model container [2022-11-16 12:50:26,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:50:25" (2/3) ... [2022-11-16 12:50:26,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556a6c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:50:26, skipping insertion in model container [2022-11-16 12:50:26,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:26" (3/3) ... [2022-11-16 12:50:26,405 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-5.i [2022-11-16 12:50:26,423 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:50:26,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:50:26,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 12:50:26,437 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:50:26,530 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-16 12:50:26,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow [2022-11-16 12:50:26,706 INFO L130 PetriNetUnfolder]: 9/119 cut-off events. [2022-11-16 12:50:26,706 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:50:26,713 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 12:50:26,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow [2022-11-16 12:50:26,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow [2022-11-16 12:50:26,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:50:26,763 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;@3362dd9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:50:26,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-16 12:50:26,782 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-16 12:50:26,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:50:26,783 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:26,784 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 12:50:26,785 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 12:50:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1999147629, now seen corresponding path program 1 times [2022-11-16 12:50:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:26,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648075552] [2022-11-16 12:50:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,062 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 12:50:27,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648075552] [2022-11-16 12:50:27,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648075552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:50:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821599003] [2022-11-16 12:50:27,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:50:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:50:27,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:50:27,148 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-11-16 12:50:27,152 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 12:50:27,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:27,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-11-16 12:50:27,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:27,242 INFO L130 PetriNetUnfolder]: 3/106 cut-off events. [2022-11-16 12:50:27,242 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:50:27,243 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 12:50:27,245 INFO L137 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2022-11-16 12:50:27,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow [2022-11-16 12:50:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:50:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:50:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2022-11-16 12:50:27,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909 [2022-11-16 12:50:27,267 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions. [2022-11-16 12:50:27,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions. [2022-11-16 12:50:27,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:27,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions. [2022-11-16 12:50:27,284 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 12:50:27,292 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 12:50:27,292 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 12:50:27,295 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions. [2022-11-16 12:50:27,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow [2022-11-16 12:50:27,305 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 12:50:27,312 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2022-11-16 12:50:27,315 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 12:50:27,320 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2022-11-16 12:50:27,321 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2022-11-16 12:50:27,323 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 12:50:27,323 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:27,323 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 12:50:27,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:50:27,324 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 12:50:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash 676304161, now seen corresponding path program 1 times [2022-11-16 12:50:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085515662] [2022-11-16 12:50:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,518 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 12:50:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085515662] [2022-11-16 12:50:27,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085515662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384896446] [2022-11-16 12:50:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:27,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:27,525 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2022-11-16 12:50:27,525 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 12:50:27,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:27,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2022-11-16 12:50:27,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:27,605 INFO L130 PetriNetUnfolder]: 12/148 cut-off events. [2022-11-16 12:50:27,605 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:50:27,606 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 12:50:27,607 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-11-16 12:50:27,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow [2022-11-16 12:50:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-11-16 12:50:27,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-11-16 12:50:27,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-11-16 12:50:27,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-11-16 12:50:27,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:27,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-11-16 12:50:27,616 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 12:50:27,617 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 12:50:27,618 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 12:50:27,618 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions. [2022-11-16 12:50:27,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow [2022-11-16 12:50:27,620 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 12:50:27,622 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow [2022-11-16 12:50:27,622 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 12:50:27,623 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-16 12:50:27,623 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow [2022-11-16 12:50:27,624 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 12:50:27,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:27,624 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 12:50:27,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:50:27,628 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-16 12:50:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1440702948, now seen corresponding path program 1 times [2022-11-16 12:50:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518191351] [2022-11-16 12:50:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,730 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 12:50:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518191351] [2022-11-16 12:50:27,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518191351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723794271] [2022-11-16 12:50:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:27,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88 [2022-11-16 12:50:27,735 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 12:50:27,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:27,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88 [2022-11-16 12:50:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:27,803 INFO L130 PetriNetUnfolder]: 1/131 cut-off events. [2022-11-16 12:50:27,803 INFO L131 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2022-11-16 12:50:27,805 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 12:50:27,807 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-11-16 12:50:27,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow [2022-11-16 12:50:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-11-16 12:50:27,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758 [2022-11-16 12:50:27,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2022-11-16 12:50:27,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2022-11-16 12:50:27,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:27,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2022-11-16 12:50:27,822 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 12:50:27,825 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 12:50:27,826 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 12:50:27,826 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions. [2022-11-16 12:50:27,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow [2022-11-16 12:50:27,830 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 12:50:27,832 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow [2022-11-16 12:50:27,833 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 12:50:27,836 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2022-11-16 12:50:27,836 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow [2022-11-16 12:50:27,837 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 12:50:27,837 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:27,837 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 12:50:27,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:50:27,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-16 12:50:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 373619005, now seen corresponding path program 1 times [2022-11-16 12:50:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:27,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577544671] [2022-11-16 12:50:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:27,943 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 12:50:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:27,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577544671] [2022-11-16 12:50:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577544671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:27,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:27,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992102436] [2022-11-16 12:50:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:27,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:27,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:27,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:27,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:27,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2022-11-16 12:50:27,953 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 12:50:27,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:27,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2022-11-16 12:50:27,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:28,060 INFO L130 PetriNetUnfolder]: 7/188 cut-off events. [2022-11-16 12:50:28,061 INFO L131 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2022-11-16 12:50:28,062 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 12:50:28,062 INFO L137 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2022-11-16 12:50:28,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow [2022-11-16 12:50:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-11-16 12:50:28,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-11-16 12:50:28,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-11-16 12:50:28,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-11-16 12:50:28,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:28,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-11-16 12:50:28,068 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 12:50:28,073 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 12:50:28,073 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 12:50:28,074 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions. [2022-11-16 12:50:28,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow [2022-11-16 12:50:28,076 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 12:50:28,080 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow [2022-11-16 12:50:28,081 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 12:50:28,083 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-16 12:50:28,083 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow [2022-11-16 12:50:28,089 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 12:50:28,090 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:28,090 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 12:50:28,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:50:28,091 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 12:50:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1959545260, now seen corresponding path program 1 times [2022-11-16 12:50:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724654489] [2022-11-16 12:50:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:50:28,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:50:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:50:28,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:50:28,202 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:50:28,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-11-16 12:50:28,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-11-16 12:50:28,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-11-16 12:50:28,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-11-16 12:50:28,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-11-16 12:50:28,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-11-16 12:50:28,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-11-16 12:50:28,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-11-16 12:50:28,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-11-16 12:50:28,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-11-16 12:50:28,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-11-16 12:50:28,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-11-16 12:50:28,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-11-16 12:50:28,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-11-16 12:50:28,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:50:28,211 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-16 12:50:28,214 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:50:28,214 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 12:50:28,239 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:50:28,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow [2022-11-16 12:50:28,275 INFO L130 PetriNetUnfolder]: 18/209 cut-off events. [2022-11-16 12:50:28,276 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 12:50:28,278 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 12:50:28,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow [2022-11-16 12:50:28,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow [2022-11-16 12:50:28,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:50:28,283 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;@3362dd9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:50:28,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-16 12:50:28,287 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-16 12:50:28,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:50:28,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:28,288 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 12:50:28,288 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 12:50:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash -746215681, now seen corresponding path program 1 times [2022-11-16 12:50:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993620239] [2022-11-16 12:50:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,309 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 12:50:28,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993620239] [2022-11-16 12:50:28,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993620239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:50:28,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036919522] [2022-11-16 12:50:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:50:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:50:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:50:28,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-11-16 12:50:28,326 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 12:50:28,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:28,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-11-16 12:50:28,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:28,393 INFO L130 PetriNetUnfolder]: 16/208 cut-off events. [2022-11-16 12:50:28,393 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-11-16 12:50:28,395 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 12:50:28,396 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2022-11-16 12:50:28,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow [2022-11-16 12:50:28,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:50:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:50:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-11-16 12:50:28,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2022-11-16 12:50:28,399 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2022-11-16 12:50:28,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2022-11-16 12:50:28,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:28,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2022-11-16 12:50:28,401 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 12:50:28,402 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 12:50:28,403 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 12:50:28,403 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions. [2022-11-16 12:50:28,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow [2022-11-16 12:50:28,405 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 12:50:28,407 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow [2022-11-16 12:50:28,407 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 12:50:28,409 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2022-11-16 12:50:28,409 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow [2022-11-16 12:50:28,409 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 12:50:28,410 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:28,410 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 12:50:28,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:50:28,411 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 12:50:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1859938163, now seen corresponding path program 1 times [2022-11-16 12:50:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500182193] [2022-11-16 12:50:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,460 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 12:50:28,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500182193] [2022-11-16 12:50:28,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500182193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240063504] [2022-11-16 12:50:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:28,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:28,465 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-11-16 12:50:28,465 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 12:50:28,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:28,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-11-16 12:50:28,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:28,600 INFO L130 PetriNetUnfolder]: 68/423 cut-off events. [2022-11-16 12:50:28,600 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 12:50:28,602 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 12:50:28,605 INFO L137 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-11-16 12:50:28,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow [2022-11-16 12:50:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-11-16 12:50:28,607 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2022-11-16 12:50:28,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-11-16 12:50:28,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-11-16 12:50:28,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:28,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-11-16 12:50:28,609 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 12:50:28,610 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 12:50:28,610 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 12:50:28,610 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions. [2022-11-16 12:50:28,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow [2022-11-16 12:50:28,612 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 12:50:28,613 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow [2022-11-16 12:50:28,614 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 12:50:28,614 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places. [2022-11-16 12:50:28,615 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow [2022-11-16 12:50:28,615 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 12:50:28,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:28,615 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 12:50:28,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:50:28,616 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 12:50:28,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1310943378, now seen corresponding path program 1 times [2022-11-16 12:50:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557832018] [2022-11-16 12:50:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,652 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 12:50:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557832018] [2022-11-16 12:50:28,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557832018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542493224] [2022-11-16 12:50:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:28,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-11-16 12:50:28,656 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 12:50:28,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:28,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-11-16 12:50:28,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:28,848 INFO L130 PetriNetUnfolder]: 52/631 cut-off events. [2022-11-16 12:50:28,848 INFO L131 PetriNetUnfolder]: For 111/313 co-relation queries the response was YES. [2022-11-16 12:50:28,850 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 12:50:28,853 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2022-11-16 12:50:28,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow [2022-11-16 12:50:28,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-11-16 12:50:28,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-16 12:50:28,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-11-16 12:50:28,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-11-16 12:50:28,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:28,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-11-16 12:50:28,857 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 12:50:28,858 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 12:50:28,859 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 12:50:28,859 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions. [2022-11-16 12:50:28,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow [2022-11-16 12:50:28,861 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 12:50:28,864 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow [2022-11-16 12:50:28,864 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 12:50:28,866 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2022-11-16 12:50:28,866 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow [2022-11-16 12:50:28,867 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 12:50:28,867 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:28,868 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 12:50:28,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:50:28,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-16 12:50:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:28,869 INFO L85 PathProgramCache]: Analyzing trace with hash 176942779, now seen corresponding path program 1 times [2022-11-16 12:50:28,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:28,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288725784] [2022-11-16 12:50:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:28,926 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 12:50:28,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:28,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288725784] [2022-11-16 12:50:28,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288725784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:28,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:28,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462093037] [2022-11-16 12:50:28,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:28,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:28,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:28,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:28,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:28,936 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-11-16 12:50:28,937 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 12:50:28,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:28,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-11-16 12:50:28,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:29,299 INFO L130 PetriNetUnfolder]: 266/1659 cut-off events. [2022-11-16 12:50:29,300 INFO L131 PetriNetUnfolder]: For 362/767 co-relation queries the response was YES. [2022-11-16 12:50:29,305 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 12:50:29,313 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2022-11-16 12:50:29,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow [2022-11-16 12:50:29,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-11-16 12:50:29,315 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-11-16 12:50:29,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-11-16 12:50:29,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-11-16 12:50:29,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:29,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-11-16 12:50:29,317 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 12:50:29,318 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 12:50:29,319 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 12:50:29,319 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions. [2022-11-16 12:50:29,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow [2022-11-16 12:50:29,325 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 12:50:29,327 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow [2022-11-16 12:50:29,327 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 12:50:29,331 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-11-16 12:50:29,331 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow [2022-11-16 12:50:29,332 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 12:50:29,332 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:29,332 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 12:50:29,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:50:29,332 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 12:50:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1184394343, now seen corresponding path program 1 times [2022-11-16 12:50:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:29,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194863322] [2022-11-16 12:50:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:29,473 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 12:50:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:29,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194863322] [2022-11-16 12:50:29,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194863322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:29,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496885875] [2022-11-16 12:50:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:29,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:29,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:29,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:29,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:50:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:29,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:50:29,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:29,718 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 12:50:29,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:29,791 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 12:50:29,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496885875] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:29,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:50:29,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 12:50:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115349808] [2022-11-16 12:50:29,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:29,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:50:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:50:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:50:29,796 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-11-16 12:50:29,797 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 12:50:29,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:29,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-11-16 12:50:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:30,060 INFO L130 PetriNetUnfolder]: 196/645 cut-off events. [2022-11-16 12:50:30,060 INFO L131 PetriNetUnfolder]: For 445/620 co-relation queries the response was YES. [2022-11-16 12:50:30,062 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 12:50:30,066 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2022-11-16 12:50:30,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow [2022-11-16 12:50:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:50:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2022-11-16 12:50:30,070 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943 [2022-11-16 12:50:30,070 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2022-11-16 12:50:30,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2022-11-16 12:50:30,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:30,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2022-11-16 12:50:30,074 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 12:50:30,076 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 12:50:30,077 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 12:50:30,077 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions. [2022-11-16 12:50:30,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow [2022-11-16 12:50:30,080 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 12:50:30,082 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow [2022-11-16 12:50:30,083 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 12:50:30,083 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2022-11-16 12:50:30,084 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow [2022-11-16 12:50:30,084 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 12:50:30,085 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:30,085 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 12:50:30,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:50:30,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:50:30,292 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 12:50:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 96829731, now seen corresponding path program 1 times [2022-11-16 12:50:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:30,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243739849] [2022-11-16 12:50:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:50:30,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:50:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:50:30,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:50:30,340 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:50:30,340 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2022-11-16 12:50:30,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2022-11-16 12:50:30,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2022-11-16 12:50:30,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2022-11-16 12:50:30,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2022-11-16 12:50:30,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2022-11-16 12:50:30,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2022-11-16 12:50:30,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2022-11-16 12:50:30,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2022-11-16 12:50:30,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2022-11-16 12:50:30,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2022-11-16 12:50:30,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2022-11-16 12:50:30,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2022-11-16 12:50:30,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2022-11-16 12:50:30,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2022-11-16 12:50:30,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2022-11-16 12:50:30,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2022-11-16 12:50:30,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2022-11-16 12:50:30,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:50:30,345 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 12:50:30,346 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:50:30,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 12:50:30,383 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 12:50:30,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow [2022-11-16 12:50:30,439 INFO L130 PetriNetUnfolder]: 34/360 cut-off events. [2022-11-16 12:50:30,440 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-16 12:50:30,442 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 12:50:30,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow [2022-11-16 12:50:30,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow [2022-11-16 12:50:30,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:50:30,447 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;@3362dd9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:50:30,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-16 12:50:30,450 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-16 12:50:30,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:50:30,450 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:30,450 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 12:50:30,451 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 12:50:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash 579667839, now seen corresponding path program 1 times [2022-11-16 12:50:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:30,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876110445] [2022-11-16 12:50:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:30,470 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 12:50:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876110445] [2022-11-16 12:50:30,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876110445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:30,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:30,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:50:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638363331] [2022-11-16 12:50:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:30,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:50:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:50:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:50:30,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128 [2022-11-16 12:50:30,475 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 12:50:30,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:30,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128 [2022-11-16 12:50:30,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:30,599 INFO L130 PetriNetUnfolder]: 84/453 cut-off events. [2022-11-16 12:50:30,599 INFO L131 PetriNetUnfolder]: For 191/217 co-relation queries the response was YES. [2022-11-16 12:50:30,601 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 12:50:30,604 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2022-11-16 12:50:30,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow [2022-11-16 12:50:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:50:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:50:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions. [2022-11-16 12:50:30,607 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.88671875 [2022-11-16 12:50:30,607 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions. [2022-11-16 12:50:30,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions. [2022-11-16 12:50:30,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:30,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions. [2022-11-16 12:50:30,609 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 12:50:30,610 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 12:50:30,612 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 12:50:30,613 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions. [2022-11-16 12:50:30,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow [2022-11-16 12:50:30,614 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 12:50:30,616 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow [2022-11-16 12:50:30,617 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 12:50:30,619 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2022-11-16 12:50:30,619 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow [2022-11-16 12:50:30,619 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 12:50:30,619 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:30,620 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 12:50:30,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:50:30,620 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 12:50:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash -93669107, now seen corresponding path program 1 times [2022-11-16 12:50:30,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:30,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092038619] [2022-11-16 12:50:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:30,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:30,674 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 12:50:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:30,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092038619] [2022-11-16 12:50:30,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092038619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:30,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:30,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:50:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72096865] [2022-11-16 12:50:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:30,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:30,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:30,678 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-16 12:50:30,679 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 12:50:30,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:30,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-16 12:50:30,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:30,925 INFO L130 PetriNetUnfolder]: 258/1209 cut-off events. [2022-11-16 12:50:30,925 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-16 12:50:30,930 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 12:50:30,937 INFO L137 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-11-16 12:50:30,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow [2022-11-16 12:50:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-11-16 12:50:30,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-11-16 12:50:30,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-11-16 12:50:30,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-11-16 12:50:30,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:30,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-11-16 12:50:30,942 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 12:50:30,943 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 12:50:30,943 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 12:50:30,943 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions. [2022-11-16 12:50:30,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow [2022-11-16 12:50:30,946 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 12:50:30,948 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow [2022-11-16 12:50:30,949 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 12:50:30,949 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places. [2022-11-16 12:50:30,949 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow [2022-11-16 12:50:30,950 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 12:50:30,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:30,950 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:30,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:50:30,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 12:50:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1706220828, now seen corresponding path program 1 times [2022-11-16 12:50:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:30,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887386844] [2022-11-16 12:50:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:30,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:30,985 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 12:50:30,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:30,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887386844] [2022-11-16 12:50:30,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887386844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:30,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:30,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190214053] [2022-11-16 12:50:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:30,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:30,989 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128 [2022-11-16 12:50:30,990 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 12:50:30,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:30,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128 [2022-11-16 12:50:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:31,730 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 12:50:31,730 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-16 12:50:31,730 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-16 12:50:31,731 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-16 12:50:31,731 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:50:31,731 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 12:50:31,731 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:31,732 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 12:50:31,732 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:31,732 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 12:50:31,732 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 12:50:31,733 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:31,733 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:31,733 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 12:50:31,733 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 12:50:31,781 INFO L130 PetriNetUnfolder]: 654/3901 cut-off events. [2022-11-16 12:50:31,781 INFO L131 PetriNetUnfolder]: For 1338/3693 co-relation queries the response was YES. [2022-11-16 12:50:31,796 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 12:50:31,820 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2022-11-16 12:50:31,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow [2022-11-16 12:50:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-16 12:50:31,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2022-11-16 12:50:31,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-16 12:50:31,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-16 12:50:31,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:31,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-16 12:50:31,825 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 12:50:31,826 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 12:50:31,826 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 12:50:31,826 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions. [2022-11-16 12:50:31,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow [2022-11-16 12:50:31,828 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 12:50:31,831 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow [2022-11-16 12:50:31,831 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 12:50:31,833 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-16 12:50:31,833 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow [2022-11-16 12:50:31,834 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 12:50:31,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:31,834 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 12:50:31,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:50:31,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 12:50:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash 913815373, now seen corresponding path program 1 times [2022-11-16 12:50:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:31,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725289350] [2022-11-16 12:50:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:31,873 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 12:50:31,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:31,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725289350] [2022-11-16 12:50:31,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725289350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:31,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:31,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:50:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972650676] [2022-11-16 12:50:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:31,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:50:31,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:50:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:50:31,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128 [2022-11-16 12:50:31,880 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 12:50:31,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:31,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128 [2022-11-16 12:50:31,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:33,753 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 12:50:33,754 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-16 12:50:33,754 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-16 12:50:33,754 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:50:33,754 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 12:50:34,070 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 12:50:34,070 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-16 12:50:34,070 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:50:34,070 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-16 12:50:34,071 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-16 12:50:34,071 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 12:50:34,071 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-16 12:50:34,071 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 12:50:34,072 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-16 12:50:34,072 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-16 12:50:34,102 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 12:50:34,102 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:34,103 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 12:50:34,103 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 12:50:34,103 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:34,220 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 12:50:34,220 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:34,220 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-16 12:50:34,220 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-16 12:50:34,220 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:34,489 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 12:50:34,489 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-16 12:50:34,489 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 12:50:34,489 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 12:50:34,490 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-16 12:50:34,513 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 12:50:34,513 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-16 12:50:34,513 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-16 12:50:34,513 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 12:50:34,513 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-16 12:50:34,513 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-16 12:50:34,514 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 12:50:34,514 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-16 12:50:34,514 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-16 12:50:34,514 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:50:34,514 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 12:50:34,974 INFO L130 PetriNetUnfolder]: 4573/16387 cut-off events. [2022-11-16 12:50:34,974 INFO L131 PetriNetUnfolder]: For 6386/11701 co-relation queries the response was YES. [2022-11-16 12:50:35,030 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 12:50:35,110 INFO L137 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2022-11-16 12:50:35,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow [2022-11-16 12:50:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:50:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:50:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-16 12:50:35,113 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-11-16 12:50:35,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-16 12:50:35,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-16 12:50:35,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:35,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-16 12:50:35,115 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 12:50:35,116 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 12:50:35,117 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 12:50:35,117 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions. [2022-11-16 12:50:35,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow [2022-11-16 12:50:35,132 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 12:50:35,135 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow [2022-11-16 12:50:35,135 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 12:50:35,136 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-16 12:50:35,136 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow [2022-11-16 12:50:35,136 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 12:50:35,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:35,137 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 12:50:35,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:50:35,137 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 12:50:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 469144953, now seen corresponding path program 1 times [2022-11-16 12:50:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:35,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958399054] [2022-11-16 12:50:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:35,228 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 12:50:35,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:35,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958399054] [2022-11-16 12:50:35,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958399054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:50:35,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742114367] [2022-11-16 12:50:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:35,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:50:35,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:50:35,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:50:35,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:50:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:35,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:50:35,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:50:35,431 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 12:50:35,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:50:35,500 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 12:50:35,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742114367] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:50:35,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:50:35,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 12:50:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055221423] [2022-11-16 12:50:35,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:50:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:50:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:50:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:50:35,506 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128 [2022-11-16 12:50:35,507 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 12:50:35,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:35,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128 [2022-11-16 12:50:35,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:39,321 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 12:50:39,322 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:39,322 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 12:50:39,322 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:39,323 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:39,323 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:39,405 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 12:50:39,405 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-11-16 12:50:39,405 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-16 12:50:39,405 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-16 12:50:39,406 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-16 12:50:39,494 INFO L130 PetriNetUnfolder]: 6176/24951 cut-off events. [2022-11-16 12:50:39,494 INFO L131 PetriNetUnfolder]: For 11078/13988 co-relation queries the response was YES. [2022-11-16 12:50:39,589 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 12:50:39,704 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions. [2022-11-16 12:50:39,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow [2022-11-16 12:50:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:50:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:50:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-11-16 12:50:39,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-11-16 12:50:39,708 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-11-16 12:50:39,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-11-16 12:50:39,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:39,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-11-16 12:50:39,712 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 12:50:39,714 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 12:50:39,715 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 12:50:39,715 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions. [2022-11-16 12:50:39,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow [2022-11-16 12:50:39,897 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 12:50:39,899 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow [2022-11-16 12:50:39,900 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 12:50:39,901 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2022-11-16 12:50:39,901 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow [2022-11-16 12:50:39,901 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 12:50:39,902 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:39,902 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 12:50:39,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:50:40,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:50:40,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 12:50:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -593229992, now seen corresponding path program 1 times [2022-11-16 12:50:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:40,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030447880] [2022-11-16 12:50:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:40,236 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 12:50:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030447880] [2022-11-16 12:50:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030447880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:40,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:40,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25575165] [2022-11-16 12:50:40,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:40,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:50:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:50:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:40,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-16 12:50:40,240 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 12:50:40,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:40,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-16 12:50:40,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:42,261 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| 5), 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 12:50:42,261 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-16 12:50:42,261 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-16 12:50:42,262 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-16 12:50:42,262 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-16 12:50:42,262 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| 5), 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 12:50:42,262 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-16 12:50:42,262 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-16 12:50:42,262 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 12:50:42,262 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-16 12:50:42,267 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| 5), 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 12:50:42,267 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-11-16 12:50:42,267 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 12:50:42,267 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-16 12:50:42,267 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-11-16 12:50:42,394 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| 5), 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 12:50:42,395 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-16 12:50:42,395 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-16 12:50:42,395 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-16 12:50:42,395 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-16 12:50:43,449 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| 5), 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 12:50:43,449 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-16 12:50:43,449 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:43,449 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:43,449 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:43,462 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| 5), 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 12:50:43,462 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-16 12:50:43,462 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 12:50:43,462 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-16 12:50:43,462 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-16 12:50:43,529 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| 5), 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 12:50:43,529 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:43,529 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-16 12:50:43,530 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:43,530 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:44,262 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| 5), 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 12:50:44,262 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 12:50:44,263 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 12:50:44,263 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:50:44,263 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:50:44,362 INFO L130 PetriNetUnfolder]: 7626/31979 cut-off events. [2022-11-16 12:50:44,362 INFO L131 PetriNetUnfolder]: For 7994/14839 co-relation queries the response was YES. [2022-11-16 12:50:44,453 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 12:50:44,558 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2022-11-16 12:50:44,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow [2022-11-16 12:50:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:50:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:50:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-11-16 12:50:44,563 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-16 12:50:44,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-11-16 12:50:44,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-11-16 12:50:44,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:44,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-11-16 12:50:44,568 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 12:50:44,572 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 12:50:44,572 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 12:50:44,573 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions. [2022-11-16 12:50:44,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow [2022-11-16 12:50:44,586 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 12:50:44,589 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow [2022-11-16 12:50:44,590 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 12:50:44,591 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places. [2022-11-16 12:50:44,592 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow [2022-11-16 12:50:44,592 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 12:50:44,592 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:44,593 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 12:50:44,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:50:44,593 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 12:50:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:44,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1860258400, now seen corresponding path program 1 times [2022-11-16 12:50:44,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:44,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682609995] [2022-11-16 12:50:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:50:44,699 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 12:50:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:50:44,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682609995] [2022-11-16 12:50:44,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682609995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:50:44,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:50:44,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:50:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92838722] [2022-11-16 12:50:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:50:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:50:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:50:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:50:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:50:44,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-16 12:50:44,704 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 12:50:44,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:50:44,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-16 12:50:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:50:47,980 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| 5), 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 12:50:47,980 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 12:50:47,980 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 12:50:47,980 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:47,980 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 12:50:48,909 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| 5), 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 12:50:48,909 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 12:50:48,909 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 12:50:48,909 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 12:50:48,909 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:50:49,000 INFO L130 PetriNetUnfolder]: 7497/33079 cut-off events. [2022-11-16 12:50:49,000 INFO L131 PetriNetUnfolder]: For 16027/21821 co-relation queries the response was YES. [2022-11-16 12:50:49,098 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 12:50:49,192 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2022-11-16 12:50:49,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow [2022-11-16 12:50:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:50:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 12:50:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-11-16 12:50:49,195 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2022-11-16 12:50:49,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-11-16 12:50:49,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-11-16 12:50:49,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:50:49,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-11-16 12:50:49,202 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 12:50:49,207 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 12:50:49,208 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 12:50:49,208 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions. [2022-11-16 12:50:49,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow [2022-11-16 12:50:49,256 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 12:50:49,260 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow [2022-11-16 12:50:49,261 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 12:50:49,262 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2022-11-16 12:50:49,263 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow [2022-11-16 12:50:49,263 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 12:50:49,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:50:49,264 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 12:50:49,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:50:49,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-16 12:50:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:50:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash -871650852, now seen corresponding path program 1 times [2022-11-16 12:50:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:50:49,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611180393] [2022-11-16 12:50:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:50:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:50:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:50:49,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:50:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:50:49,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:50:49,314 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:50:49,314 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-16 12:50:49,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-16 12:50:49,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-16 12:50:49,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-16 12:50:49,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-16 12:50:49,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-16 12:50:49,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-16 12:50:49,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-16 12:50:49,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-16 12:50:49,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-16 12:50:49,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2022-11-16 12:50:49,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-11-16 12:50:49,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-11-16 12:50:49,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-16 12:50:49,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-16 12:50:49,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-16 12:50:49,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-16 12:50:49,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-16 12:50:49,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-16 12:50:49,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-16 12:50:49,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-16 12:50:49,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-16 12:50:49,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:50:49,320 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:50:49,326 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-16 12:50:49,326 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:50:49,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:50:49 BasicIcfg [2022-11-16 12:50:49,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:50:49,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:50:49,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:50:49,431 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:50:49,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:50:26" (3/4) ... [2022-11-16 12:50:49,435 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:50:49,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:50:49,436 INFO L158 Benchmark]: Toolchain (without parser) took 24642.56ms. Allocated memory was 134.2MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 100.0MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 829.8MB. Max. memory is 16.1GB. [2022-11-16 12:50:49,436 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 92.3MB. Free memory was 46.0MB in the beginning and 45.9MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:50:49,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 737.50ms. Allocated memory is still 134.2MB. Free memory was 100.0MB in the beginning and 100.9MB in the end (delta: -839.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:50:49,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.77ms. Allocated memory is still 134.2MB. Free memory was 100.9MB in the beginning and 99.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:50:49,438 INFO L158 Benchmark]: Boogie Preprocessor took 34.45ms. Allocated memory is still 134.2MB. Free memory was 99.2MB in the beginning and 97.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:50:49,438 INFO L158 Benchmark]: RCFGBuilder took 762.90ms. Allocated memory is still 134.2MB. Free memory was 97.5MB in the beginning and 81.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-16 12:50:49,438 INFO L158 Benchmark]: TraceAbstraction took 23045.27ms. Allocated memory was 134.2MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 80.3MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 813.6MB. Max. memory is 16.1GB. [2022-11-16 12:50:49,439 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 8.4GB. Free memory is still 7.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:50:49,443 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.28ms. Allocated memory is still 92.3MB. Free memory was 46.0MB in the beginning and 45.9MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 737.50ms. Allocated memory is still 134.2MB. Free memory was 100.0MB in the beginning and 100.9MB in the end (delta: -839.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.77ms. Allocated memory is still 134.2MB. Free memory was 100.9MB in the beginning and 99.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.45ms. Allocated memory is still 134.2MB. Free memory was 99.2MB in the beginning and 97.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 762.90ms. Allocated memory is still 134.2MB. Free memory was 97.5MB in the beginning and 81.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23045.27ms. Allocated memory was 134.2MB in the beginning and 8.4GB in the end (delta: 8.3GB). Free memory was 80.3MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 813.6MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 8.4GB. Free memory is still 7.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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[5]; VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 5 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=5, 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=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=5, 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=5, 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=5, 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=5, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 5 VAL [\old(argc)=49, arg={0:0}, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=5, 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=5, 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=5, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (5 - (((5 / 10) == 0) ? 1 : (5 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=5, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=5, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=5, 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.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 9 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.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: 2.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 21 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 311 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 134 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.4s 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 12:50:49,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_094294d4-8cb1-4eee-803e-c9d14a20a16b/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