./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:37:47,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:37:47,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:37:47,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:37:47,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:37:47,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:37:47,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:37:47,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:37:47,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:37:47,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:37:47,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:37:47,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:37:47,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:37:47,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:37:47,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:37:47,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:37:47,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:37:47,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:37:47,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:37:47,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:37:47,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:37:47,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:37:47,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:37:47,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:37:47,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:37:47,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:37:47,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:37:47,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:37:47,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:37:47,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:37:47,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:37:47,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:37:47,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:37:47,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:37:47,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:37:47,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:37:47,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:37:47,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:37:47,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:37:47,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:37:47,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:37:47,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:37:47,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:37:47,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:37:47,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:37:47,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:37:47,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:37:47,328 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:37:47,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:37:47,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:37:47,329 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:37:47,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:37:47,331 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:37:47,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:37:47,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:37:47,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:37:47,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:37:47,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:37:47,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:37:47,333 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:37:47,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:37:47,334 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:37:47,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:37:47,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:37:47,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:37:47,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:37:47,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:37:47,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:37:47,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:37:47,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:37:47,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:37:47,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:37:47,338 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:37:47,338 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:37:47,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:37:47,339 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_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 0f0c41cc4bbd081542690b2b24113aecb06bc89521cb806ea9d2ea12042870bc [2022-11-20 09:37:47,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:37:47,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:37:47,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:37:47,778 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:37:47,778 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:37:47,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-11-20 09:37:51,197 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:37:51,625 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:37:51,626 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2022-11-20 09:37:51,643 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/data/eebd04c37/719cddba01c7438698e357012076e281/FLAG156562cad [2022-11-20 09:37:51,662 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/data/eebd04c37/719cddba01c7438698e357012076e281 [2022-11-20 09:37:51,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:37:51,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:37:51,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:37:51,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:37:51,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:37:51,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:37:51" (1/1) ... [2022-11-20 09:37:51,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f739d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:51, skipping insertion in model container [2022-11-20 09:37:51,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:37:51" (1/1) ... [2022-11-20 09:37:51,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:37:51,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:37:51,976 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-20 09:37:52,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:37:52,327 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:37:52,346 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/sv-benchmarks/c/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-20 09:37:52,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:37:52,502 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:37:52,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52 WrapperNode [2022-11-20 09:37:52,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:37:52,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:37:52,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:37:52,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:37:52,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,607 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-11-20 09:37:52,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:37:52,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:37:52,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:37:52,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:37:52,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:37:52,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:37:52,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:37:52,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:37:52,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (1/1) ... [2022-11-20 09:37:52,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:37:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:37:52,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:37:52,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:37:52,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:37:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:37:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:37:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:37:52,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:37:52,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:37:52,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:37:52,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:37:52,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:37:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:37:52,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:37:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:37:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:37:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:37:52,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:37:52,828 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:37:53,067 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:37:53,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:37:53,435 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:37:53,700 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:37:53,700 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:37:53,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:37:53 BoogieIcfgContainer [2022-11-20 09:37:53,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:37:53,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:37:53,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:37:53,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:37:53,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:37:51" (1/3) ... [2022-11-20 09:37:53,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf56485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:37:53, skipping insertion in model container [2022-11-20 09:37:53,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:37:52" (2/3) ... [2022-11-20 09:37:53,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf56485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:37:53, skipping insertion in model container [2022-11-20 09:37:53,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:37:53" (3/3) ... [2022-11-20 09:37:53,716 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2022-11-20 09:37:53,728 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:37:53,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:37:53,743 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 09:37:53,743 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:37:53,865 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:37:53,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-11-20 09:37:54,041 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-20 09:37:54,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:37:54,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-11-20 09:37:54,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-11-20 09:37:54,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-11-20 09:37:54,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:37:54,092 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;@47b90284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:37:54,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 09:37:54,136 INFO L130 PetriNetUnfolder]: 0/71 cut-off events. [2022-11-20 09:37:54,136 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:37:54,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:37:54,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:54,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:37:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1771681722, now seen corresponding path program 1 times [2022-11-20 09:37:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:54,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923251794] [2022-11-20 09:37:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:55,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923251794] [2022-11-20 09:37:55,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923251794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:37:55,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:37:55,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:37:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912704009] [2022-11-20 09:37:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:37:55,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:37:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:37:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:37:55,360 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 113 [2022-11-20 09:37:55,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:55,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:37:55,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 113 [2022-11-20 09:37:55,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:37:55,555 INFO L130 PetriNetUnfolder]: 10/178 cut-off events. [2022-11-20 09:37:55,556 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 09:37:55,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 178 events. 10/178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 337 event pairs, 4 based on Foata normal form. 5/174 useless extension candidates. Maximal degree in co-relation 165. Up to 17 conditions per place. [2022-11-20 09:37:55,563 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 8 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2022-11-20 09:37:55,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 245 flow [2022-11-20 09:37:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:37:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 09:37:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2022-11-20 09:37:55,595 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9380530973451328 [2022-11-20 09:37:55,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2022-11-20 09:37:55,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2022-11-20 09:37:55,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:37:55,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2022-11-20 09:37:55,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:55,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:55,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:55,631 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 318 transitions. [2022-11-20 09:37:55,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 245 flow [2022-11-20 09:37:55,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 108 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 09:37:55,647 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-11-20 09:37:55,650 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-11-20 09:37:55,658 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-11-20 09:37:55,659 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-11-20 09:37:55,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:55,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:37:55,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:55,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:37:55,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:37:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1111124186, now seen corresponding path program 1 times [2022-11-20 09:37:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523661645] [2022-11-20 09:37:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:56,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:56,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523661645] [2022-11-20 09:37:56,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523661645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:37:56,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:37:56,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:37:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164361268] [2022-11-20 09:37:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:37:56,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:37:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:37:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:37:56,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 09:37:56,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:56,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:37:56,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 09:37:56,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:37:57,459 INFO L130 PetriNetUnfolder]: 653/2092 cut-off events. [2022-11-20 09:37:57,459 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-11-20 09:37:57,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3295 conditions, 2092 events. 653/2092 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16711 event pairs, 155 based on Foata normal form. 0/2024 useless extension candidates. Maximal degree in co-relation 3241. Up to 437 conditions per place. [2022-11-20 09:37:57,477 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 26 selfloop transitions, 5 changer transitions 58/164 dead transitions. [2022-11-20 09:37:57,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 164 transitions, 510 flow [2022-11-20 09:37:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:37:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:37:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-11-20 09:37:57,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8662733529990168 [2022-11-20 09:37:57,482 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2022-11-20 09:37:57,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2022-11-20 09:37:57,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:37:57,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2022-11-20 09:37:57,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:57,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:57,493 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:57,493 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 9 states and 881 transitions. [2022-11-20 09:37:57,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 164 transitions, 510 flow [2022-11-20 09:37:57,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 164 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 09:37:57,498 INFO L231 Difference]: Finished difference. Result has 129 places, 98 transitions, 268 flow [2022-11-20 09:37:57,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=129, PETRI_TRANSITIONS=98} [2022-11-20 09:37:57,500 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-11-20 09:37:57,500 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 98 transitions, 268 flow [2022-11-20 09:37:57,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:57,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:37:57,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:57,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:37:57,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:37:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:57,503 INFO L85 PathProgramCache]: Analyzing trace with hash -872655675, now seen corresponding path program 1 times [2022-11-20 09:37:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:57,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860155551] [2022-11-20 09:37:57,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860155551] [2022-11-20 09:37:57,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860155551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:37:57,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:37:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:37:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080014686] [2022-11-20 09:37:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:37:57,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:37:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:37:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:37:57,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-20 09:37:57,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 98 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:57,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:37:57,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-20 09:37:57,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:37:58,846 INFO L130 PetriNetUnfolder]: 1259/2658 cut-off events. [2022-11-20 09:37:58,847 INFO L131 PetriNetUnfolder]: For 2423/2704 co-relation queries the response was YES. [2022-11-20 09:37:58,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6088 conditions, 2658 events. 1259/2658 cut-off events. For 2423/2704 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 19206 event pairs, 71 based on Foata normal form. 40/2522 useless extension candidates. Maximal degree in co-relation 6028. Up to 770 conditions per place. [2022-11-20 09:37:58,872 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 34 selfloop transitions, 7 changer transitions 38/158 dead transitions. [2022-11-20 09:37:58,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 158 transitions, 634 flow [2022-11-20 09:37:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:37:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 09:37:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2022-11-20 09:37:58,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8699115044247787 [2022-11-20 09:37:58,878 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2022-11-20 09:37:58,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2022-11-20 09:37:58,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:37:58,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2022-11-20 09:37:58,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:58,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:58,891 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:58,891 INFO L175 Difference]: Start difference. First operand has 129 places, 98 transitions, 268 flow. Second operand 10 states and 983 transitions. [2022-11-20 09:37:58,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 158 transitions, 634 flow [2022-11-20 09:37:58,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 158 transitions, 604 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-20 09:37:58,910 INFO L231 Difference]: Finished difference. Result has 124 places, 102 transitions, 314 flow [2022-11-20 09:37:58,911 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=314, PETRI_PLACES=124, PETRI_TRANSITIONS=102} [2022-11-20 09:37:58,914 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 6 predicate places. [2022-11-20 09:37:58,914 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 314 flow [2022-11-20 09:37:58,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:58,915 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:37:58,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:58,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:37:58,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:37:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash -257899710, now seen corresponding path program 1 times [2022-11-20 09:37:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:58,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195930751] [2022-11-20 09:37:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195930751] [2022-11-20 09:37:59,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195930751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:37:59,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:37:59,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:37:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361744974] [2022-11-20 09:37:59,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:37:59,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:37:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:37:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:37:59,406 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-20 09:37:59,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:59,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:37:59,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-20 09:37:59,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:00,104 INFO L130 PetriNetUnfolder]: 593/1534 cut-off events. [2022-11-20 09:38:00,104 INFO L131 PetriNetUnfolder]: For 2741/2878 co-relation queries the response was YES. [2022-11-20 09:38:00,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 1534 events. 593/1534 cut-off events. For 2741/2878 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10843 event pairs, 49 based on Foata normal form. 78/1561 useless extension candidates. Maximal degree in co-relation 4647. Up to 433 conditions per place. [2022-11-20 09:38:00,117 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 42 selfloop transitions, 18 changer transitions 28/167 dead transitions. [2022-11-20 09:38:00,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 167 transitions, 855 flow [2022-11-20 09:38:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:38:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:38:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1082 transitions. [2022-11-20 09:38:00,122 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704746580852776 [2022-11-20 09:38:00,123 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1082 transitions. [2022-11-20 09:38:00,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1082 transitions. [2022-11-20 09:38:00,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:00,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1082 transitions. [2022-11-20 09:38:00,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.36363636363636) internal successors, (1082), 11 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:00,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:00,138 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:00,138 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 314 flow. Second operand 11 states and 1082 transitions. [2022-11-20 09:38:00,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 167 transitions, 855 flow [2022-11-20 09:38:00,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 167 transitions, 833 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-11-20 09:38:00,156 INFO L231 Difference]: Finished difference. Result has 129 places, 117 transitions, 485 flow [2022-11-20 09:38:00,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=485, PETRI_PLACES=129, PETRI_TRANSITIONS=117} [2022-11-20 09:38:00,158 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2022-11-20 09:38:00,164 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 117 transitions, 485 flow [2022-11-20 09:38:00,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:00,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:00,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:00,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:38:00,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:38:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash -57416926, now seen corresponding path program 1 times [2022-11-20 09:38:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:00,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275922869] [2022-11-20 09:38:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:00,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:00,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275922869] [2022-11-20 09:38:00,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275922869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:38:00,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:38:00,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:38:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923449666] [2022-11-20 09:38:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:38:00,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:38:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:38:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:38:00,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-20 09:38:00,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 117 transitions, 485 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:00,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:38:00,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-20 09:38:00,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:01,400 INFO L130 PetriNetUnfolder]: 494/1373 cut-off events. [2022-11-20 09:38:01,401 INFO L131 PetriNetUnfolder]: For 4167/4360 co-relation queries the response was YES. [2022-11-20 09:38:01,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4872 conditions, 1373 events. 494/1373 cut-off events. For 4167/4360 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10425 event pairs, 26 based on Foata normal form. 68/1391 useless extension candidates. Maximal degree in co-relation 4803. Up to 367 conditions per place. [2022-11-20 09:38:01,416 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 37 selfloop transitions, 22 changer transitions 26/164 dead transitions. [2022-11-20 09:38:01,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 923 flow [2022-11-20 09:38:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:38:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-20 09:38:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1346 transitions. [2022-11-20 09:38:01,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8508217446270544 [2022-11-20 09:38:01,422 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1346 transitions. [2022-11-20 09:38:01,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1346 transitions. [2022-11-20 09:38:01,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:01,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1346 transitions. [2022-11-20 09:38:01,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 96.14285714285714) internal successors, (1346), 14 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:01,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:01,433 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:01,434 INFO L175 Difference]: Start difference. First operand has 129 places, 117 transitions, 485 flow. Second operand 14 states and 1346 transitions. [2022-11-20 09:38:01,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 923 flow [2022-11-20 09:38:01,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 164 transitions, 853 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-11-20 09:38:01,482 INFO L231 Difference]: Finished difference. Result has 147 places, 118 transitions, 503 flow [2022-11-20 09:38:01,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=503, PETRI_PLACES=147, PETRI_TRANSITIONS=118} [2022-11-20 09:38:01,485 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 29 predicate places. [2022-11-20 09:38:01,486 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 118 transitions, 503 flow [2022-11-20 09:38:01,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:01,487 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:01,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:01,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:38:01,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:38:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:01,489 INFO L85 PathProgramCache]: Analyzing trace with hash -137804658, now seen corresponding path program 1 times [2022-11-20 09:38:01,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:01,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752679437] [2022-11-20 09:38:01,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:01,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752679437] [2022-11-20 09:38:01,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752679437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:38:01,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:38:01,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:38:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743294842] [2022-11-20 09:38:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:38:01,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:38:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:01,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:38:01,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:38:01,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-20 09:38:01,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 118 transitions, 503 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:01,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:38:01,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-20 09:38:01,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:02,445 INFO L130 PetriNetUnfolder]: 192/1172 cut-off events. [2022-11-20 09:38:02,445 INFO L131 PetriNetUnfolder]: For 2685/2719 co-relation queries the response was YES. [2022-11-20 09:38:02,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3450 conditions, 1172 events. 192/1172 cut-off events. For 2685/2719 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10690 event pairs, 14 based on Foata normal form. 1/1119 useless extension candidates. Maximal degree in co-relation 3377. Up to 162 conditions per place. [2022-11-20 09:38:02,459 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 31 selfloop transitions, 11 changer transitions 6/141 dead transitions. [2022-11-20 09:38:02,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 141 transitions, 689 flow [2022-11-20 09:38:02,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:38:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:38:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 742 transitions. [2022-11-20 09:38:02,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8207964601769911 [2022-11-20 09:38:02,463 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 742 transitions. [2022-11-20 09:38:02,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 742 transitions. [2022-11-20 09:38:02,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:02,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 742 transitions. [2022-11-20 09:38:02,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:02,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:02,472 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 113.0) internal successors, (1017), 9 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:02,472 INFO L175 Difference]: Start difference. First operand has 147 places, 118 transitions, 503 flow. Second operand 8 states and 742 transitions. [2022-11-20 09:38:02,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 141 transitions, 689 flow [2022-11-20 09:38:02,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 141 transitions, 581 flow, removed 36 selfloop flow, removed 16 redundant places. [2022-11-20 09:38:02,520 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 497 flow [2022-11-20 09:38:02,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=497, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2022-11-20 09:38:02,524 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2022-11-20 09:38:02,524 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 497 flow [2022-11-20 09:38:02,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:02,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:02,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:02,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:38:02,526 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:38:02,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2091647724, now seen corresponding path program 2 times [2022-11-20 09:38:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:02,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134254297] [2022-11-20 09:38:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:02,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134254297] [2022-11-20 09:38:02,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134254297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:38:02,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:38:02,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:38:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040110404] [2022-11-20 09:38:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:38:03,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:38:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:38:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:38:03,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-20 09:38:03,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 497 flow. Second operand has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:03,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:38:03,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-20 09:38:03,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:03,523 INFO L130 PetriNetUnfolder]: 255/1537 cut-off events. [2022-11-20 09:38:03,524 INFO L131 PetriNetUnfolder]: For 1578/1593 co-relation queries the response was YES. [2022-11-20 09:38:03,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1537 events. 255/1537 cut-off events. For 1578/1593 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15553 event pairs, 18 based on Foata normal form. 1/1462 useless extension candidates. Maximal degree in co-relation 3872. Up to 196 conditions per place. [2022-11-20 09:38:03,539 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 23 selfloop transitions, 7 changer transitions 24/147 dead transitions. [2022-11-20 09:38:03,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 147 transitions, 695 flow [2022-11-20 09:38:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:38:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:38:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 834 transitions. [2022-11-20 09:38:03,544 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8200589970501475 [2022-11-20 09:38:03,544 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 834 transitions. [2022-11-20 09:38:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 834 transitions. [2022-11-20 09:38:03,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:03,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 834 transitions. [2022-11-20 09:38:03,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:03,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:03,551 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:03,552 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 497 flow. Second operand 9 states and 834 transitions. [2022-11-20 09:38:03,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 147 transitions, 695 flow [2022-11-20 09:38:03,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 147 transitions, 679 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-20 09:38:03,583 INFO L231 Difference]: Finished difference. Result has 146 places, 118 transitions, 461 flow [2022-11-20 09:38:03,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=461, PETRI_PLACES=146, PETRI_TRANSITIONS=118} [2022-11-20 09:38:03,584 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 28 predicate places. [2022-11-20 09:38:03,585 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 118 transitions, 461 flow [2022-11-20 09:38:03,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:03,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:03,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:38:03,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:38:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1169422108, now seen corresponding path program 3 times [2022-11-20 09:38:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:03,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895150493] [2022-11-20 09:38:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:04,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895150493] [2022-11-20 09:38:04,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895150493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:38:04,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:38:04,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:38:04,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407226878] [2022-11-20 09:38:04,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:38:04,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:38:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:04,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:38:04,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:38:04,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2022-11-20 09:38:04,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 118 transitions, 461 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:04,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:38:04,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2022-11-20 09:38:04,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:05,020 INFO L130 PetriNetUnfolder]: 163/1085 cut-off events. [2022-11-20 09:38:05,021 INFO L131 PetriNetUnfolder]: For 1192/1210 co-relation queries the response was YES. [2022-11-20 09:38:05,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1085 events. 163/1085 cut-off events. For 1192/1210 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10291 event pairs, 2 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 2670. Up to 154 conditions per place. [2022-11-20 09:38:05,030 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 20 selfloop transitions, 10 changer transitions 29/140 dead transitions. [2022-11-20 09:38:05,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 140 transitions, 686 flow [2022-11-20 09:38:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:38:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 09:38:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 899 transitions. [2022-11-20 09:38:05,034 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7955752212389381 [2022-11-20 09:38:05,034 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 899 transitions. [2022-11-20 09:38:05,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 899 transitions. [2022-11-20 09:38:05,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:05,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 899 transitions. [2022-11-20 09:38:05,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.9) internal successors, (899), 10 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,043 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,043 INFO L175 Difference]: Start difference. First operand has 146 places, 118 transitions, 461 flow. Second operand 10 states and 899 transitions. [2022-11-20 09:38:05,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 140 transitions, 686 flow [2022-11-20 09:38:05,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 140 transitions, 594 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-11-20 09:38:05,064 INFO L231 Difference]: Finished difference. Result has 146 places, 110 transitions, 394 flow [2022-11-20 09:38:05,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=394, PETRI_PLACES=146, PETRI_TRANSITIONS=110} [2022-11-20 09:38:05,067 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 28 predicate places. [2022-11-20 09:38:05,068 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 110 transitions, 394 flow [2022-11-20 09:38:05,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,069 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:05,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:05,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:38:05,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:38:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1643854828, now seen corresponding path program 4 times [2022-11-20 09:38:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:05,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74922082] [2022-11-20 09:38:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:05,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:05,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74922082] [2022-11-20 09:38:05,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74922082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:38:05,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:38:05,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:38:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479927341] [2022-11-20 09:38:05,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:38:05,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:38:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:05,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:38:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:38:05,416 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-20 09:38:05,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 110 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:38:05,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-20 09:38:05,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:05,622 INFO L130 PetriNetUnfolder]: 40/369 cut-off events. [2022-11-20 09:38:05,623 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2022-11-20 09:38:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 369 events. 40/369 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2174 event pairs, 1 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 767. Up to 60 conditions per place. [2022-11-20 09:38:05,625 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 15 selfloop transitions, 4 changer transitions 18/117 dead transitions. [2022-11-20 09:38:05,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 117 transitions, 488 flow [2022-11-20 09:38:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:38:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:38:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 655 transitions. [2022-11-20 09:38:05,627 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8280657395701644 [2022-11-20 09:38:05,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 655 transitions. [2022-11-20 09:38:05,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 655 transitions. [2022-11-20 09:38:05,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:05,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 655 transitions. [2022-11-20 09:38:05,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.57142857142857) internal successors, (655), 7 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,632 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,632 INFO L175 Difference]: Start difference. First operand has 146 places, 110 transitions, 394 flow. Second operand 7 states and 655 transitions. [2022-11-20 09:38:05,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 117 transitions, 488 flow [2022-11-20 09:38:05,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 117 transitions, 435 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-20 09:38:05,637 INFO L231 Difference]: Finished difference. Result has 135 places, 99 transitions, 304 flow [2022-11-20 09:38:05,638 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=135, PETRI_TRANSITIONS=99} [2022-11-20 09:38:05,639 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2022-11-20 09:38:05,639 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 99 transitions, 304 flow [2022-11-20 09:38:05,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:05,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:05,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:05,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:38:05,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-20 09:38:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 277774706, now seen corresponding path program 5 times [2022-11-20 09:38:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:05,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709802604] [2022-11-20 09:38:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:38:05,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:38:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:38:05,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:38:05,780 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:38:05,782 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-20 09:38:05,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-20 09:38:05,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-20 09:38:05,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-20 09:38:05,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-20 09:38:05,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-20 09:38:05,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:38:05,792 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2022-11-20 09:38:05,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:38:05,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:38:05,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:38:05 BasicIcfg [2022-11-20 09:38:05,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:38:05,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:38:05,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:38:05,918 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:38:05,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:37:53" (3/4) ... [2022-11-20 09:38:05,921 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 09:38:06,040 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:38:06,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:38:06,041 INFO L158 Benchmark]: Toolchain (without parser) took 14374.45ms. Allocated memory was 136.3MB in the beginning and 268.4MB in the end (delta: 132.1MB). Free memory was 104.0MB in the beginning and 157.0MB in the end (delta: -53.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2022-11-20 09:38:06,042 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 136.3MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:38:06,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 835.06ms. Allocated memory is still 136.3MB. Free memory was 103.5MB in the beginning and 81.3MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 09:38:06,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.69ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 78.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:38:06,042 INFO L158 Benchmark]: Boogie Preprocessor took 66.09ms. Allocated memory is still 136.3MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:38:06,043 INFO L158 Benchmark]: RCFGBuilder took 1012.68ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 77.1MB in the beginning and 145.8MB in the end (delta: -68.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-11-20 09:38:06,043 INFO L158 Benchmark]: TraceAbstraction took 12210.29ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 144.8MB in the beginning and 179.0MB in the end (delta: -34.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-11-20 09:38:06,044 INFO L158 Benchmark]: Witness Printer took 122.81ms. Allocated memory is still 268.4MB. Free memory was 179.0MB in the beginning and 157.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 09:38:06,047 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.31ms. Allocated memory is still 136.3MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 835.06ms. Allocated memory is still 136.3MB. Free memory was 103.5MB in the beginning and 81.3MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.69ms. Allocated memory is still 136.3MB. Free memory was 81.3MB in the beginning and 78.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.09ms. Allocated memory is still 136.3MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1012.68ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 77.1MB in the beginning and 145.8MB in the end (delta: -68.7MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12210.29ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 144.8MB in the beginning and 179.0MB in the end (delta: -34.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 122.81ms. Allocated memory is still 268.4MB. Free memory was 179.0MB in the beginning and 157.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1394; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-2, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1395; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=-1, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1396; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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. - UnprovableResult [Line: 828]: 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. - UnprovableResult [Line: 824]: 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 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 352 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 87 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=503occurred in iteration=5, InterpolantAutomatonStates: 81, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 708 ConstructedInterpolants, 0 QuantifiedInterpolants, 2843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 09:38:06,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209a9a1d-f3df-4ce5-b543-56ecbcac7eb8/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE