./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc --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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- 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-5e519f3 [2022-11-02 20:52:11,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:52:11,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:52:11,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:52:11,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:52:11,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:52:11,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:52:11,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:52:11,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:52:11,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:52:11,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:52:11,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:52:11,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:52:11,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:52:11,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:52:11,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:52:11,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:52:11,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:52:11,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:52:11,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:52:11,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:52:11,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:52:11,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:52:11,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:52:11,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:52:11,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:52:11,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:52:11,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:52:11,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:52:11,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:52:11,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:52:11,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:52:11,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:52:11,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:52:11,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:52:11,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:52:11,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:52:11,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:52:11,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:52:11,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:52:11,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:52:11,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:52:11,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:52:11,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:52:11,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:52:11,464 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:52:11,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:52:11,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:52:11,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:52:11,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:52:11,466 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:52:11,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:52:11,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:52:11,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:52:11,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:52:11,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:52:11,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:52:11,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:52:11,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:52:11,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:52:11,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:52:11,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:52:11,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:52:11,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:52:11,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:52:11,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:52:11,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:11,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:52:11,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:52:11,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:52:11,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:52:11,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:52:11,472 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:52:11,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:52:11,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:52:11,472 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_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/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_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2022-11-02 20:52:11,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:52:11,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:52:11,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:52:11,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:52:11,850 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:52:11,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i [2022-11-02 20:52:11,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/data/9b763f128/ee5411941c9b447d876558e4298dacce/FLAG6f0fe8014 [2022-11-02 20:52:12,527 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:52:12,528 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2022-11-02 20:52:12,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/data/9b763f128/ee5411941c9b447d876558e4298dacce/FLAG6f0fe8014 [2022-11-02 20:52:12,926 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/data/9b763f128/ee5411941c9b447d876558e4298dacce [2022-11-02 20:52:12,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:52:12,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:52:12,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:12,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:52:12,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:52:12,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:12" (1/1) ... [2022-11-02 20:52:12,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3798c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:12, skipping insertion in model container [2022-11-02 20:52:12,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:52:12" (1/1) ... [2022-11-02 20:52:12,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:52:12,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:52:13,206 WARN L230 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_e9e563d9-8588-4575-a880-2a69d93b4122/sv-benchmarks/c/pthread-wmm/mix027_tso.i[944,957] [2022-11-02 20:52:13,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:13,478 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:52:13,489 WARN L230 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_e9e563d9-8588-4575-a880-2a69d93b4122/sv-benchmarks/c/pthread-wmm/mix027_tso.i[944,957] [2022-11-02 20:52:13,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:52:13,582 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:52:13,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13 WrapperNode [2022-11-02 20:52:13,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:52:13,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:13,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:52:13,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:52:13,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,640 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-11-02 20:52:13,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:52:13,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:52:13,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:52:13,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:52:13,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,694 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:52:13,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:52:13,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:52:13,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:52:13,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (1/1) ... [2022-11-02 20:52:13,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:52:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:13,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:52:13,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:52:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:52:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:52:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:52:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:52:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:52:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-02 20:52:13,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-02 20:52:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-02 20:52:13,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-02 20:52:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-02 20:52:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-02 20:52:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-02 20:52:13,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-02 20:52:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:52:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:52:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:52:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:52:13,822 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:52:14,071 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:52:14,074 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:52:14,790 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:52:15,355 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:52:15,356 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:52:15,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:15 BoogieIcfgContainer [2022-11-02 20:52:15,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:52:15,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:52:15,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:52:15,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:52:15,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:52:12" (1/3) ... [2022-11-02 20:52:15,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555f5fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:15, skipping insertion in model container [2022-11-02 20:52:15,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:52:13" (2/3) ... [2022-11-02 20:52:15,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555f5fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:52:15, skipping insertion in model container [2022-11-02 20:52:15,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:15" (3/3) ... [2022-11-02 20:52:15,368 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-11-02 20:52:15,378 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:52:15,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:52:15,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:52:15,389 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:52:15,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:52:15,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-02 20:52:15,628 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-02 20:52:15,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:52:15,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-11-02 20:52:15,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-02 20:52:15,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-02 20:52:15,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:52:15,670 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;@5dfe8bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:52:15,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-02 20:52:15,698 INFO L130 PetriNetUnfolder]: 0/65 cut-off events. [2022-11-02 20:52:15,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:52:15,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:15,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:15,701 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1421907133, now seen corresponding path program 1 times [2022-11-02 20:52:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:15,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517612321] [2022-11-02 20:52:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:16,367 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-02 20:52:16,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:16,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517612321] [2022-11-02 20:52:16,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517612321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:16,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:16,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:52:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264958071] [2022-11-02 20:52:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:16,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:52:16,432 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 137 [2022-11-02 20:52:16,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:16,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:16,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 137 [2022-11-02 20:52:16,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:16,859 INFO L130 PetriNetUnfolder]: 161/1031 cut-off events. [2022-11-02 20:52:16,859 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-02 20:52:16,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 1031 events. 161/1031 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6993 event pairs, 103 based on Foata normal form. 34/1000 useless extension candidates. Maximal degree in co-relation 1276. Up to 187 conditions per place. [2022-11-02 20:52:16,876 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 17 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2022-11-02 20:52:16,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 328 flow [2022-11-02 20:52:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:52:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-02 20:52:16,900 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2022-11-02 20:52:16,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-02 20:52:16,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-02 20:52:16,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:16,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-02 20:52:16,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:16,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:16,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:16,930 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 387 transitions. [2022-11-02 20:52:16,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 328 flow [2022-11-02 20:52:16,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 136 transitions, 322 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:52:16,945 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-02 20:52:16,948 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-02 20:52:16,952 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-02 20:52:16,952 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-02 20:52:16,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:16,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:16,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:16,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:52:16,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2065629017, now seen corresponding path program 1 times [2022-11-02 20:52:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:16,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654650586] [2022-11-02 20:52:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,457 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-02 20:52:17,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654650586] [2022-11-02 20:52:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654650586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:17,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:17,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583971139] [2022-11-02 20:52:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:17,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:17,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:17,462 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-02 20:52:17,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:17,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:17,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-02 20:52:17,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:19,178 INFO L130 PetriNetUnfolder]: 2208/5484 cut-off events. [2022-11-02 20:52:19,178 INFO L131 PetriNetUnfolder]: For 308/308 co-relation queries the response was YES. [2022-11-02 20:52:19,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8986 conditions, 5484 events. 2208/5484 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 49022 event pairs, 510 based on Foata normal form. 0/5365 useless extension candidates. Maximal degree in co-relation 8930. Up to 1862 conditions per place. [2022-11-02 20:52:19,219 INFO L137 encePairwiseOnDemand]: 130/137 looper letters, 24 selfloop transitions, 3 changer transitions 62/184 dead transitions. [2022-11-02 20:52:19,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 184 transitions, 548 flow [2022-11-02 20:52:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:52:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-11-02 20:52:19,223 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2022-11-02 20:52:19,223 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-11-02 20:52:19,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-11-02 20:52:19,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:19,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-11-02 20:52:19,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:19,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:19,272 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:19,273 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1086 transitions. [2022-11-02 20:52:19,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 184 transitions, 548 flow [2022-11-02 20:52:19,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 184 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:52:19,280 INFO L231 Difference]: Finished difference. Result has 153 places, 117 transitions, 281 flow [2022-11-02 20:52:19,280 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=153, PETRI_TRANSITIONS=117} [2022-11-02 20:52:19,281 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-11-02 20:52:19,282 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 117 transitions, 281 flow [2022-11-02 20:52:19,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:19,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:19,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:19,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:52:19,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash 954989320, now seen corresponding path program 1 times [2022-11-02 20:52:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704808334] [2022-11-02 20:52:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:19,722 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-02 20:52:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:19,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704808334] [2022-11-02 20:52:19,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704808334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:19,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:19,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499771151] [2022-11-02 20:52:19,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:19,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:19,729 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2022-11-02 20:52:19,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 117 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:19,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:19,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2022-11-02 20:52:19,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:20,767 INFO L130 PetriNetUnfolder]: 1120/2139 cut-off events. [2022-11-02 20:52:20,768 INFO L131 PetriNetUnfolder]: For 1372/1384 co-relation queries the response was YES. [2022-11-02 20:52:20,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2139 events. 1120/2139 cut-off events. For 1372/1384 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14202 event pairs, 201 based on Foata normal form. 66/2126 useless extension candidates. Maximal degree in co-relation 4734. Up to 757 conditions per place. [2022-11-02 20:52:20,790 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 2 changer transitions 37/159 dead transitions. [2022-11-02 20:52:20,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 159 transitions, 503 flow [2022-11-02 20:52:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:52:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:52:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1088 transitions. [2022-11-02 20:52:20,795 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8824006488240065 [2022-11-02 20:52:20,796 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1088 transitions. [2022-11-02 20:52:20,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1088 transitions. [2022-11-02 20:52:20,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:20,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1088 transitions. [2022-11-02 20:52:20,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:20,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:20,803 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:20,803 INFO L175 Difference]: Start difference. First operand has 153 places, 117 transitions, 281 flow. Second operand 9 states and 1088 transitions. [2022-11-02 20:52:20,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 159 transitions, 503 flow [2022-11-02 20:52:20,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 484 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-02 20:52:20,822 INFO L231 Difference]: Finished difference. Result has 144 places, 117 transitions, 290 flow [2022-11-02 20:52:20,823 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=290, PETRI_PLACES=144, PETRI_TRANSITIONS=117} [2022-11-02 20:52:20,825 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-11-02 20:52:20,825 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 290 flow [2022-11-02 20:52:20,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:20,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:20,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:20,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:52:20,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1517397671, now seen corresponding path program 1 times [2022-11-02 20:52:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:20,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132780563] [2022-11-02 20:52:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:21,650 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-02 20:52:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:21,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132780563] [2022-11-02 20:52:21,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132780563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:21,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:21,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:52:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367081409] [2022-11-02 20:52:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:21,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:52:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:52:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:21,655 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 20:52:21,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 290 flow. Second operand has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:21,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:21,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 20:52:21,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:22,927 INFO L130 PetriNetUnfolder]: 1301/2525 cut-off events. [2022-11-02 20:52:22,928 INFO L131 PetriNetUnfolder]: For 2115/2165 co-relation queries the response was YES. [2022-11-02 20:52:22,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 2525 events. 1301/2525 cut-off events. For 2115/2165 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16725 event pairs, 312 based on Foata normal form. 58/2519 useless extension candidates. Maximal degree in co-relation 5677. Up to 1076 conditions per place. [2022-11-02 20:52:22,962 INFO L137 encePairwiseOnDemand]: 122/137 looper letters, 25 selfloop transitions, 13 changer transitions 52/185 dead transitions. [2022-11-02 20:52:22,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 185 transitions, 660 flow [2022-11-02 20:52:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:52:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:52:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1853 transitions. [2022-11-02 20:52:22,968 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8453467153284672 [2022-11-02 20:52:22,968 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1853 transitions. [2022-11-02 20:52:22,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1853 transitions. [2022-11-02 20:52:22,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:22,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1853 transitions. [2022-11-02 20:52:22,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.8125) internal successors, (1853), 16 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,981 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,981 INFO L175 Difference]: Start difference. First operand has 144 places, 117 transitions, 290 flow. Second operand 16 states and 1853 transitions. [2022-11-02 20:52:22,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 185 transitions, 660 flow [2022-11-02 20:52:22,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 185 transitions, 616 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-11-02 20:52:23,000 INFO L231 Difference]: Finished difference. Result has 156 places, 125 transitions, 386 flow [2022-11-02 20:52:23,000 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=386, PETRI_PLACES=156, PETRI_TRANSITIONS=125} [2022-11-02 20:52:23,001 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 12 predicate places. [2022-11-02 20:52:23,001 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 125 transitions, 386 flow [2022-11-02 20:52:23,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.45454545454545) internal successors, (1226), 11 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:23,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:23,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:23,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:52:23,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1508569959, now seen corresponding path program 1 times [2022-11-02 20:52:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:23,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653868997] [2022-11-02 20:52:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:24,127 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-02 20:52:24,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:24,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653868997] [2022-11-02 20:52:24,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653868997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:24,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:24,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427103829] [2022-11-02 20:52:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:24,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:24,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:24,132 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2022-11-02 20:52:24,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 125 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:24,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:24,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2022-11-02 20:52:24,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:25,431 INFO L130 PetriNetUnfolder]: 1103/2290 cut-off events. [2022-11-02 20:52:25,431 INFO L131 PetriNetUnfolder]: For 7419/8052 co-relation queries the response was YES. [2022-11-02 20:52:25,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8559 conditions, 2290 events. 1103/2290 cut-off events. For 7419/8052 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14943 event pairs, 537 based on Foata normal form. 47/2246 useless extension candidates. Maximal degree in co-relation 8476. Up to 1112 conditions per place. [2022-11-02 20:52:25,474 INFO L137 encePairwiseOnDemand]: 123/137 looper letters, 37 selfloop transitions, 20 changer transitions 50/201 dead transitions. [2022-11-02 20:52:25,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 201 transitions, 1150 flow [2022-11-02 20:52:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:52:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:52:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1842 transitions. [2022-11-02 20:52:25,479 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8403284671532847 [2022-11-02 20:52:25,480 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1842 transitions. [2022-11-02 20:52:25,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1842 transitions. [2022-11-02 20:52:25,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:25,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1842 transitions. [2022-11-02 20:52:25,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.125) internal successors, (1842), 16 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:25,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:25,490 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:25,491 INFO L175 Difference]: Start difference. First operand has 156 places, 125 transitions, 386 flow. Second operand 16 states and 1842 transitions. [2022-11-02 20:52:25,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 201 transitions, 1150 flow [2022-11-02 20:52:25,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 201 transitions, 1126 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-11-02 20:52:25,513 INFO L231 Difference]: Finished difference. Result has 168 places, 142 transitions, 614 flow [2022-11-02 20:52:25,514 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=614, PETRI_PLACES=168, PETRI_TRANSITIONS=142} [2022-11-02 20:52:25,515 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 24 predicate places. [2022-11-02 20:52:25,515 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 142 transitions, 614 flow [2022-11-02 20:52:25,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:25,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:25,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:25,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:52:25,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1613543243, now seen corresponding path program 2 times [2022-11-02 20:52:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:25,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685935266] [2022-11-02 20:52:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,635 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-02 20:52:26,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:26,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685935266] [2022-11-02 20:52:26,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685935266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:26,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:26,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:52:26,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508364481] [2022-11-02 20:52:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:26,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:52:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:26,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:52:26,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:52:26,639 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-11-02 20:52:26,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 142 transitions, 614 flow. Second operand has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:26,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:26,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-11-02 20:52:26,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:27,848 INFO L130 PetriNetUnfolder]: 1058/2128 cut-off events. [2022-11-02 20:52:27,848 INFO L131 PetriNetUnfolder]: For 15127/16598 co-relation queries the response was YES. [2022-11-02 20:52:27,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10620 conditions, 2128 events. 1058/2128 cut-off events. For 15127/16598 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13715 event pairs, 527 based on Foata normal form. 78/2140 useless extension candidates. Maximal degree in co-relation 10526. Up to 1072 conditions per place. [2022-11-02 20:52:27,896 INFO L137 encePairwiseOnDemand]: 123/137 looper letters, 38 selfloop transitions, 25 changer transitions 34/190 dead transitions. [2022-11-02 20:52:27,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 190 transitions, 1287 flow [2022-11-02 20:52:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:52:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1587 transitions. [2022-11-02 20:52:27,902 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8274244004171012 [2022-11-02 20:52:27,902 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1587 transitions. [2022-11-02 20:52:27,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1587 transitions. [2022-11-02 20:52:27,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:27,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1587 transitions. [2022-11-02 20:52:27,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.35714285714286) internal successors, (1587), 14 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:27,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:27,915 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 137.0) internal successors, (2055), 15 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:27,915 INFO L175 Difference]: Start difference. First operand has 168 places, 142 transitions, 614 flow. Second operand 14 states and 1587 transitions. [2022-11-02 20:52:27,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 190 transitions, 1287 flow [2022-11-02 20:52:27,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 190 transitions, 1215 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-11-02 20:52:27,936 INFO L231 Difference]: Finished difference. Result has 175 places, 150 transitions, 744 flow [2022-11-02 20:52:27,937 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=744, PETRI_PLACES=175, PETRI_TRANSITIONS=150} [2022-11-02 20:52:27,940 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 31 predicate places. [2022-11-02 20:52:27,940 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 150 transitions, 744 flow [2022-11-02 20:52:27,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:27,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:27,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:27,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:52:27,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:27,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -219008225, now seen corresponding path program 1 times [2022-11-02 20:52:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:27,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770512730] [2022-11-02 20:52:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:28,766 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-02 20:52:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770512730] [2022-11-02 20:52:28,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770512730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:28,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:28,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:52:28,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566493681] [2022-11-02 20:52:28,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:28,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:52:28,778 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-02 20:52:28,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 150 transitions, 744 flow. Second operand has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:28,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:28,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-02 20:52:28,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:29,885 INFO L130 PetriNetUnfolder]: 947/2018 cut-off events. [2022-11-02 20:52:29,886 INFO L131 PetriNetUnfolder]: For 25057/25929 co-relation queries the response was YES. [2022-11-02 20:52:29,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11926 conditions, 2018 events. 947/2018 cut-off events. For 25057/25929 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12554 event pairs, 264 based on Foata normal form. 53/1981 useless extension candidates. Maximal degree in co-relation 11826. Up to 806 conditions per place. [2022-11-02 20:52:29,928 INFO L137 encePairwiseOnDemand]: 124/137 looper letters, 59 selfloop transitions, 15 changer transitions 32/202 dead transitions. [2022-11-02 20:52:29,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 202 transitions, 1636 flow [2022-11-02 20:52:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:52:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:52:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1520 transitions. [2022-11-02 20:52:29,932 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8534531162268388 [2022-11-02 20:52:29,932 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1520 transitions. [2022-11-02 20:52:29,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1520 transitions. [2022-11-02 20:52:29,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:29,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1520 transitions. [2022-11-02 20:52:29,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.92307692307692) internal successors, (1520), 13 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,941 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,941 INFO L175 Difference]: Start difference. First operand has 175 places, 150 transitions, 744 flow. Second operand 13 states and 1520 transitions. [2022-11-02 20:52:29,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 202 transitions, 1636 flow [2022-11-02 20:52:29,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 202 transitions, 1549 flow, removed 30 selfloop flow, removed 11 redundant places. [2022-11-02 20:52:29,985 INFO L231 Difference]: Finished difference. Result has 178 places, 155 transitions, 812 flow [2022-11-02 20:52:29,985 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=812, PETRI_PLACES=178, PETRI_TRANSITIONS=155} [2022-11-02 20:52:29,986 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2022-11-02 20:52:29,987 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 155 transitions, 812 flow [2022-11-02 20:52:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:29,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:29,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:52:29,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1405998582, now seen corresponding path program 1 times [2022-11-02 20:52:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977280261] [2022-11-02 20:52:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,239 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-02 20:52:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:30,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977280261] [2022-11-02 20:52:30,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977280261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:30,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:30,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793484590] [2022-11-02 20:52:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:30,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:30,242 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 20:52:30,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 155 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:30,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:30,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 20:52:30,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:33,259 INFO L130 PetriNetUnfolder]: 5670/9834 cut-off events. [2022-11-02 20:52:33,260 INFO L131 PetriNetUnfolder]: For 119748/122535 co-relation queries the response was YES. [2022-11-02 20:52:33,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48309 conditions, 9834 events. 5670/9834 cut-off events. For 119748/122535 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 76458 event pairs, 138 based on Foata normal form. 176/9689 useless extension candidates. Maximal degree in co-relation 48211. Up to 3301 conditions per place. [2022-11-02 20:52:33,473 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 147 selfloop transitions, 18 changer transitions 30/293 dead transitions. [2022-11-02 20:52:33,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 293 transitions, 2723 flow [2022-11-02 20:52:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:52:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1200 transitions. [2022-11-02 20:52:33,478 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8759124087591241 [2022-11-02 20:52:33,478 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1200 transitions. [2022-11-02 20:52:33,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1200 transitions. [2022-11-02 20:52:33,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:33,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1200 transitions. [2022-11-02 20:52:33,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:33,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:33,486 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:33,486 INFO L175 Difference]: Start difference. First operand has 178 places, 155 transitions, 812 flow. Second operand 10 states and 1200 transitions. [2022-11-02 20:52:33,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 293 transitions, 2723 flow [2022-11-02 20:52:33,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 293 transitions, 2015 flow, removed 319 selfloop flow, removed 18 redundant places. [2022-11-02 20:52:33,596 INFO L231 Difference]: Finished difference. Result has 169 places, 158 transitions, 696 flow [2022-11-02 20:52:33,596 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=696, PETRI_PLACES=169, PETRI_TRANSITIONS=158} [2022-11-02 20:52:33,597 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 25 predicate places. [2022-11-02 20:52:33,597 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 696 flow [2022-11-02 20:52:33,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:33,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:33,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:33,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:52:33,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash -514847641, now seen corresponding path program 1 times [2022-11-02 20:52:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:33,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595855809] [2022-11-02 20:52:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:34,006 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-02 20:52:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:34,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595855809] [2022-11-02 20:52:34,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595855809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:34,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:34,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443762254] [2022-11-02 20:52:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:34,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:34,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:34,011 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 20:52:34,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 696 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:34,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:34,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 20:52:34,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:36,433 INFO L130 PetriNetUnfolder]: 5028/9380 cut-off events. [2022-11-02 20:52:36,433 INFO L131 PetriNetUnfolder]: For 61208/62681 co-relation queries the response was YES. [2022-11-02 20:52:36,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41717 conditions, 9380 events. 5028/9380 cut-off events. For 61208/62681 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 78076 event pairs, 189 based on Foata normal form. 260/9450 useless extension candidates. Maximal degree in co-relation 41627. Up to 2053 conditions per place. [2022-11-02 20:52:36,560 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 177 selfloop transitions, 36 changer transitions 24/335 dead transitions. [2022-11-02 20:52:36,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 335 transitions, 2652 flow [2022-11-02 20:52:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:52:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:52:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1562 transitions. [2022-11-02 20:52:36,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8770353733857383 [2022-11-02 20:52:36,565 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1562 transitions. [2022-11-02 20:52:36,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1562 transitions. [2022-11-02 20:52:36,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:36,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1562 transitions. [2022-11-02 20:52:36,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.15384615384616) internal successors, (1562), 13 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:36,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:36,579 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:36,579 INFO L175 Difference]: Start difference. First operand has 169 places, 158 transitions, 696 flow. Second operand 13 states and 1562 transitions. [2022-11-02 20:52:36,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 335 transitions, 2652 flow [2022-11-02 20:52:36,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 335 transitions, 2650 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:52:36,695 INFO L231 Difference]: Finished difference. Result has 186 places, 178 transitions, 981 flow [2022-11-02 20:52:36,695 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=981, PETRI_PLACES=186, PETRI_TRANSITIONS=178} [2022-11-02 20:52:36,696 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 42 predicate places. [2022-11-02 20:52:36,697 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 178 transitions, 981 flow [2022-11-02 20:52:36,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:36,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:36,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:36,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:52:36,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1435627586, now seen corresponding path program 1 times [2022-11-02 20:52:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:36,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483272358] [2022-11-02 20:52:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:36,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:37,244 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-02 20:52:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:37,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483272358] [2022-11-02 20:52:37,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483272358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:37,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:37,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:52:37,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400322254] [2022-11-02 20:52:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:37,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:52:37,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:37,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:52:37,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:37,252 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 20:52:37,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 178 transitions, 981 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:37,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:37,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 20:52:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:39,894 INFO L130 PetriNetUnfolder]: 4686/8931 cut-off events. [2022-11-02 20:52:39,894 INFO L131 PetriNetUnfolder]: For 70411/71633 co-relation queries the response was YES. [2022-11-02 20:52:39,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44540 conditions, 8931 events. 4686/8931 cut-off events. For 70411/71633 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 76634 event pairs, 111 based on Foata normal form. 211/8975 useless extension candidates. Maximal degree in co-relation 44442. Up to 1873 conditions per place. [2022-11-02 20:52:40,030 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 163 selfloop transitions, 56 changer transitions 49/366 dead transitions. [2022-11-02 20:52:40,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 366 transitions, 3329 flow [2022-11-02 20:52:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:52:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-02 20:52:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1925 transitions. [2022-11-02 20:52:40,036 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8781934306569343 [2022-11-02 20:52:40,036 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1925 transitions. [2022-11-02 20:52:40,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1925 transitions. [2022-11-02 20:52:40,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:40,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1925 transitions. [2022-11-02 20:52:40,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.3125) internal successors, (1925), 16 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:40,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:40,049 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:40,049 INFO L175 Difference]: Start difference. First operand has 186 places, 178 transitions, 981 flow. Second operand 16 states and 1925 transitions. [2022-11-02 20:52:40,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 366 transitions, 3329 flow [2022-11-02 20:52:40,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 366 transitions, 3152 flow, removed 66 selfloop flow, removed 6 redundant places. [2022-11-02 20:52:40,749 INFO L231 Difference]: Finished difference. Result has 199 places, 201 transitions, 1301 flow [2022-11-02 20:52:40,750 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1301, PETRI_PLACES=199, PETRI_TRANSITIONS=201} [2022-11-02 20:52:40,750 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 55 predicate places. [2022-11-02 20:52:40,751 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 201 transitions, 1301 flow [2022-11-02 20:52:40,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:40,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:40,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:40,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:52:40,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 668802603, now seen corresponding path program 1 times [2022-11-02 20:52:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:40,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075132720] [2022-11-02 20:52:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:41,229 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-02 20:52:41,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:41,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075132720] [2022-11-02 20:52:41,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075132720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:41,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:41,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:52:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156477822] [2022-11-02 20:52:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:41,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:52:41,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:52:41,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:52:41,231 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 137 [2022-11-02 20:52:41,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 201 transitions, 1301 flow. Second operand has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:41,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:41,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 137 [2022-11-02 20:52:41,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:43,547 INFO L130 PetriNetUnfolder]: 4599/8765 cut-off events. [2022-11-02 20:52:43,547 INFO L131 PetriNetUnfolder]: For 70351/71767 co-relation queries the response was YES. [2022-11-02 20:52:43,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43182 conditions, 8765 events. 4599/8765 cut-off events. For 70351/71767 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 75190 event pairs, 186 based on Foata normal form. 150/8728 useless extension candidates. Maximal degree in co-relation 43114. Up to 1805 conditions per place. [2022-11-02 20:52:43,637 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 152 selfloop transitions, 61 changer transitions 58/369 dead transitions. [2022-11-02 20:52:43,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 369 transitions, 3308 flow [2022-11-02 20:52:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:52:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-02 20:52:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2242 transitions. [2022-11-02 20:52:43,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8613138686131386 [2022-11-02 20:52:43,644 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2242 transitions. [2022-11-02 20:52:43,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2242 transitions. [2022-11-02 20:52:43,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:43,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2242 transitions. [2022-11-02 20:52:43,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 118.0) internal successors, (2242), 19 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:43,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:43,655 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:43,655 INFO L175 Difference]: Start difference. First operand has 199 places, 201 transitions, 1301 flow. Second operand 19 states and 2242 transitions. [2022-11-02 20:52:43,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 369 transitions, 3308 flow [2022-11-02 20:52:44,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 369 transitions, 2749 flow, removed 217 selfloop flow, removed 20 redundant places. [2022-11-02 20:52:44,646 INFO L231 Difference]: Finished difference. Result has 204 places, 200 transitions, 1098 flow [2022-11-02 20:52:44,646 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1098, PETRI_PLACES=204, PETRI_TRANSITIONS=200} [2022-11-02 20:52:44,647 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 60 predicate places. [2022-11-02 20:52:44,647 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 200 transitions, 1098 flow [2022-11-02 20:52:44,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:44,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:44,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:44,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:52:44,649 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1069110181, now seen corresponding path program 1 times [2022-11-02 20:52:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:44,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530870426] [2022-11-02 20:52:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:45,065 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-02 20:52:45,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:45,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530870426] [2022-11-02 20:52:45,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530870426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:45,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:45,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936023170] [2022-11-02 20:52:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:45,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:45,069 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-02 20:52:45,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 200 transitions, 1098 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:45,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:45,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-02 20:52:45,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:46,346 INFO L130 PetriNetUnfolder]: 1728/5858 cut-off events. [2022-11-02 20:52:46,346 INFO L131 PetriNetUnfolder]: For 13949/14841 co-relation queries the response was YES. [2022-11-02 20:52:46,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18861 conditions, 5858 events. 1728/5858 cut-off events. For 13949/14841 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 67057 event pairs, 58 based on Foata normal form. 37/5572 useless extension candidates. Maximal degree in co-relation 18784. Up to 551 conditions per place. [2022-11-02 20:52:46,400 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 66 selfloop transitions, 2 changer transitions 8/238 dead transitions. [2022-11-02 20:52:46,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 238 transitions, 1495 flow [2022-11-02 20:52:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:52:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-11-02 20:52:46,403 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8561001042752867 [2022-11-02 20:52:46,403 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-11-02 20:52:46,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-11-02 20:52:46,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:46,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-11-02 20:52:46,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:46,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:46,407 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:46,407 INFO L175 Difference]: Start difference. First operand has 204 places, 200 transitions, 1098 flow. Second operand 7 states and 821 transitions. [2022-11-02 20:52:46,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 238 transitions, 1495 flow [2022-11-02 20:52:46,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 238 transitions, 1357 flow, removed 23 selfloop flow, removed 16 redundant places. [2022-11-02 20:52:46,754 INFO L231 Difference]: Finished difference. Result has 196 places, 201 transitions, 999 flow [2022-11-02 20:52:46,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=999, PETRI_PLACES=196, PETRI_TRANSITIONS=201} [2022-11-02 20:52:46,755 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 52 predicate places. [2022-11-02 20:52:46,755 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 201 transitions, 999 flow [2022-11-02 20:52:46,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:46,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:46,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:46,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:52:46,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1080472623, now seen corresponding path program 2 times [2022-11-02 20:52:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:46,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599921002] [2022-11-02 20:52:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:47,117 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-02 20:52:47,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:47,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599921002] [2022-11-02 20:52:47,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599921002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:47,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:47,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068401926] [2022-11-02 20:52:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:47,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:47,120 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-02 20:52:47,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 201 transitions, 999 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:47,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:47,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-02 20:52:47,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:48,874 INFO L130 PetriNetUnfolder]: 3337/11102 cut-off events. [2022-11-02 20:52:48,874 INFO L131 PetriNetUnfolder]: For 17618/18297 co-relation queries the response was YES. [2022-11-02 20:52:48,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32150 conditions, 11102 events. 3337/11102 cut-off events. For 17618/18297 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 144982 event pairs, 66 based on Foata normal form. 41/10398 useless extension candidates. Maximal degree in co-relation 32114. Up to 1479 conditions per place. [2022-11-02 20:52:48,994 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 74 selfloop transitions, 2 changer transitions 7/246 dead transitions. [2022-11-02 20:52:48,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 246 transitions, 1449 flow [2022-11-02 20:52:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:52:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2022-11-02 20:52:48,997 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8581856100104275 [2022-11-02 20:52:48,997 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2022-11-02 20:52:48,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2022-11-02 20:52:48,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:48,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2022-11-02 20:52:48,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,001 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:49,002 INFO L175 Difference]: Start difference. First operand has 196 places, 201 transitions, 999 flow. Second operand 7 states and 823 transitions. [2022-11-02 20:52:49,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 246 transitions, 1449 flow [2022-11-02 20:52:50,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 246 transitions, 1438 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-02 20:52:50,124 INFO L231 Difference]: Finished difference. Result has 200 places, 202 transitions, 1011 flow [2022-11-02 20:52:50,125 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1011, PETRI_PLACES=200, PETRI_TRANSITIONS=202} [2022-11-02 20:52:50,125 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 56 predicate places. [2022-11-02 20:52:50,125 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 202 transitions, 1011 flow [2022-11-02 20:52:50,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:50,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:50,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:50,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:52:50,126 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1074231405, now seen corresponding path program 3 times [2022-11-02 20:52:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:50,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018280252] [2022-11-02 20:52:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:50,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-02 20:52:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018280252] [2022-11-02 20:52:50,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018280252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:50,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:50,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768008530] [2022-11-02 20:52:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:50,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:50,416 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-02 20:52:50,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 202 transitions, 1011 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:50,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:50,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-02 20:52:50,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:53,575 INFO L130 PetriNetUnfolder]: 5833/19121 cut-off events. [2022-11-02 20:52:53,576 INFO L131 PetriNetUnfolder]: For 31192/31914 co-relation queries the response was YES. [2022-11-02 20:52:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55632 conditions, 19121 events. 5833/19121 cut-off events. For 31192/31914 co-relation queries the response was YES. Maximal size of possible extension queue 2374. Compared 270956 event pairs, 146 based on Foata normal form. 78/17904 useless extension candidates. Maximal degree in co-relation 55594. Up to 2284 conditions per place. [2022-11-02 20:52:53,781 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 31 selfloop transitions, 2 changer transitions 40/232 dead transitions. [2022-11-02 20:52:53,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 232 transitions, 1326 flow [2022-11-02 20:52:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:52:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2022-11-02 20:52:53,783 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077 [2022-11-02 20:52:53,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2022-11-02 20:52:53,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2022-11-02 20:52:53,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:53,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2022-11-02 20:52:53,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:53,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:53,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:53,788 INFO L175 Difference]: Start difference. First operand has 200 places, 202 transitions, 1011 flow. Second operand 6 states and 706 transitions. [2022-11-02 20:52:53,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 232 transitions, 1326 flow [2022-11-02 20:52:56,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 232 transitions, 1315 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-02 20:52:56,618 INFO L231 Difference]: Finished difference. Result has 202 places, 187 transitions, 930 flow [2022-11-02 20:52:56,619 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=202, PETRI_TRANSITIONS=187} [2022-11-02 20:52:56,619 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 58 predicate places. [2022-11-02 20:52:56,620 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 187 transitions, 930 flow [2022-11-02 20:52:56,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:56,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:56,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:52:56,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:52:56,621 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-02 20:52:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1246402147, now seen corresponding path program 4 times [2022-11-02 20:52:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:56,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883729729] [2022-11-02 20:52:56,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:56,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:56,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:52:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:52:56,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:52:56,844 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:52:56,845 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-02 20:52:56,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-02 20:52:56,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-02 20:52:56,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-02 20:52:56,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-02 20:52:56,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-02 20:52:56,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-02 20:52:56,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:52:56,849 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:56,857 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:52:56,858 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:52:57,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:52:57 BasicIcfg [2022-11-02 20:52:57,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:52:57,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:52:57,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:52:57,044 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:52:57,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:52:15" (3/4) ... [2022-11-02 20:52:57,046 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 20:52:57,176 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:52:57,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:52:57,177 INFO L158 Benchmark]: Toolchain (without parser) took 44246.74ms. Allocated memory was 96.5MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 59.2MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 992.5MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,177 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 96.5MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 112.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:52:57,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.23ms. Allocated memory is still 96.5MB. Free memory was 59.0MB in the beginning and 57.0MB in the end (delta: 2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.45ms. Allocated memory is still 96.5MB. Free memory was 57.0MB in the beginning and 53.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,178 INFO L158 Benchmark]: Boogie Preprocessor took 73.59ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 51.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,178 INFO L158 Benchmark]: RCFGBuilder took 1643.35ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 51.1MB in the beginning and 73.7MB in the end (delta: -22.6MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,179 INFO L158 Benchmark]: TraceAbstraction took 41681.93ms. Allocated memory was 117.4MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 72.6MB in the beginning and 7.1GB in the end (delta: -7.1GB). Peak memory consumption was 938.3MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,179 INFO L158 Benchmark]: Witness Printer took 132.53ms. Allocated memory is still 8.1GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-11-02 20:52:57,181 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.25ms. Allocated memory is still 96.5MB. Free memory was 77.3MB in the beginning and 77.2MB in the end (delta: 112.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.23ms. Allocated memory is still 96.5MB. Free memory was 59.0MB in the beginning and 57.0MB in the end (delta: 2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.45ms. Allocated memory is still 96.5MB. Free memory was 57.0MB in the beginning and 53.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.59ms. Allocated memory is still 96.5MB. Free memory was 53.9MB in the beginning and 51.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1643.35ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 51.1MB in the beginning and 73.7MB in the end (delta: -22.6MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41681.93ms. Allocated memory was 117.4MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 72.6MB in the beginning and 7.1GB in the end (delta: -7.1GB). Peak memory consumption was 938.3MB. Max. memory is 16.1GB. * Witness Printer took 132.53ms. Allocated memory is still 8.1GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t737; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t738; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t739; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 pthread_t t740; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - 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: 858]: 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: 852]: 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: 856]: 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: 854]: 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 9 procedures, 174 locations, 7 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: 41.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 553 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2275 IncrementalHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 115 mSDtfsCounter, 2275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1301occurred in iteration=10, InterpolantAutomatonStates: 158, 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.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1273 ConstructedInterpolants, 0 QuantifiedInterpolants, 5618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-02 20:52:57,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9e563d9-8588-4575-a880-2a69d93b4122/bin/uautomizer-Dbtcem3rbc/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