./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R --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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- 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-38b53e6 [2022-11-25 17:07:39,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:07:39,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:07:39,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:07:39,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:07:39,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:07:39,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:07:39,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:07:39,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:07:39,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:07:39,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:07:39,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:07:39,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:07:39,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:07:39,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:07:39,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:07:39,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:07:39,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:07:39,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:07:39,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:07:39,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:07:39,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:07:39,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:07:39,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:07:39,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:07:39,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:07:39,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:07:39,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:07:39,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:07:39,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:07:39,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:07:39,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:07:39,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:07:39,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:07:39,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:07:39,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:07:39,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:07:39,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:07:39,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:07:39,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:07:39,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:07:39,656 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:07:39,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:07:39,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:07:39,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:07:39,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:07:39,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:07:39,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:07:39,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:07:39,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:07:39,709 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:07:39,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:07:39,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:07:39,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:07:39,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:07:39,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:07:39,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:07:39,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:07:39,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:07:39,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:07:39,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:07:39,714 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:07:39,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:07:39,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:07:39,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:07:39,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:07:39,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:39,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:07:39,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:07:39,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:07:39,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:07:39,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:07:39,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:07:39,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:07:39,719 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:07:39,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:07:39,719 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/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_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R 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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2022-11-25 17:07:40,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:07:40,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:07:40,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:07:40,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:07:40,062 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:07:40,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:07:43,241 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:07:43,483 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:07:43,490 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:07:43,508 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/data/bacaf08d6/2e123e6c6ac0402a9010a22ad79a1fde/FLAG72f0e58e7 [2022-11-25 17:07:43,530 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/data/bacaf08d6/2e123e6c6ac0402a9010a22ad79a1fde [2022-11-25 17:07:43,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:07:43,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:07:43,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:43,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:07:43,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:07:43,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:43" (1/1) ... [2022-11-25 17:07:43,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319c93ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:43, skipping insertion in model container [2022-11-25 17:07:43,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:43" (1/1) ... [2022-11-25 17:07:43,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:07:43,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:07:43,813 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:07:44,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:44,117 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:07:44,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:07:44,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:44,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:44,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:44,280 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:07:44,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44 WrapperNode [2022-11-25 17:07:44,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:44,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:44,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:07:44,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:07:44,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,372 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-25 17:07:44,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:44,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:07:44,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:07:44,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:07:44,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,412 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:07:44,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:07:44,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:07:44,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:07:44,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (1/1) ... [2022-11-25 17:07:44,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:44,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:44,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:07:44,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:07:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:07:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:07:44,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:07:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:07:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:07:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:07:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:07:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:07:44,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:07:44,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:07:44,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:07:44,572 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:07:44,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:07:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:07:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:07:44,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:07:44,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:07:44,576 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:07:44,781 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:07:44,783 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:07:45,144 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:07:45,348 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:07:45,348 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:07:45,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:45 BoogieIcfgContainer [2022-11-25 17:07:45,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:07:45,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:07:45,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:07:45,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:07:45,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:07:43" (1/3) ... [2022-11-25 17:07:45,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771881cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:45, skipping insertion in model container [2022-11-25 17:07:45,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:44" (2/3) ... [2022-11-25 17:07:45,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771881cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:45, skipping insertion in model container [2022-11-25 17:07:45,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:45" (3/3) ... [2022-11-25 17:07:45,371 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:07:45,383 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:07:45,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:07:45,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:07:45,398 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:07:45,515 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:07:45,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 17:07:45,653 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 17:07:45,653 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:45,662 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 71 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-25 17:07:45,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 17:07:45,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-25 17:07:45,677 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:07:45,693 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 17:07:45,696 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 17:07:45,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-11-25 17:07:45,768 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 17:07:45,769 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:45,770 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 71 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-25 17:07:45,772 INFO L119 LiptonReduction]: Number of co-enabled transitions 3404 [2022-11-25 17:07:51,098 INFO L134 LiptonReduction]: Checked pairs total: 9799 [2022-11-25 17:07:51,099 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-25 17:07:51,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:07:51,122 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;@8d8dbbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:07:51,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 17:07:51,125 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-25 17:07:51,125 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:51,125 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:51,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:07:51,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:07:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 566254, now seen corresponding path program 1 times [2022-11-25 17:07:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:51,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027204967] [2022-11-25 17:07:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:51,678 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-25 17:07:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027204967] [2022-11-25 17:07:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027204967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:51,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:51,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797748972] [2022-11-25 17:07:51,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:51,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:51,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:51,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:51,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 251 [2022-11-25 17:07:51,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:51,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:51,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 251 [2022-11-25 17:07:51,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:53,281 INFO L130 PetriNetUnfolder]: 5879/8061 cut-off events. [2022-11-25 17:07:53,282 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-25 17:07:53,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16205 conditions, 8061 events. 5879/8061 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 39736 event pairs, 3031 based on Foata normal form. 0/7723 useless extension candidates. Maximal degree in co-relation 16193. Up to 6367 conditions per place. [2022-11-25 17:07:53,341 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2022-11-25 17:07:53,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 217 flow [2022-11-25 17:07:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2022-11-25 17:07:53,366 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.548472775564409 [2022-11-25 17:07:53,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2022-11-25 17:07:53,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2022-11-25 17:07:53,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:53,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2022-11-25 17:07:53,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:53,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:53,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:53,392 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 413 transitions. [2022-11-25 17:07:53,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 217 flow [2022-11-25 17:07:53,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:07:53,399 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-11-25 17:07:53,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-25 17:07:53,410 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-25 17:07:53,410 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-11-25 17:07:53,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:53,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:53,411 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:07:53,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:07:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1613166118, now seen corresponding path program 1 times [2022-11-25 17:07:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:53,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747350528] [2022-11-25 17:07:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:53,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:53,876 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-25 17:07:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:53,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747350528] [2022-11-25 17:07:53,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747350528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:53,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:53,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421727364] [2022-11-25 17:07:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:53,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:53,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-11-25 17:07:53,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:53,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:53,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-11-25 17:07:53,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:58,728 INFO L130 PetriNetUnfolder]: 24272/32879 cut-off events. [2022-11-25 17:07:58,728 INFO L131 PetriNetUnfolder]: For 1497/1497 co-relation queries the response was YES. [2022-11-25 17:07:58,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67764 conditions, 32879 events. 24272/32879 cut-off events. For 1497/1497 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 180965 event pairs, 7272 based on Foata normal form. 1359/34238 useless extension candidates. Maximal degree in co-relation 67754. Up to 16693 conditions per place. [2022-11-25 17:07:58,914 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 45 selfloop transitions, 8 changer transitions 35/88 dead transitions. [2022-11-25 17:07:58,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 374 flow [2022-11-25 17:07:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-11-25 17:07:58,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5059760956175299 [2022-11-25 17:07:58,921 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-11-25 17:07:58,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-11-25 17:07:58,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:58,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-11-25 17:07:58,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:58,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:58,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:58,930 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 5 states and 635 transitions. [2022-11-25 17:07:58,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 374 flow [2022-11-25 17:07:58,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:58,934 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 146 flow [2022-11-25 17:07:58,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-11-25 17:07:58,936 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-11-25 17:07:58,937 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 146 flow [2022-11-25 17:07:58,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:58,942 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:58,942 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:58,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:07:58,943 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:07:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:58,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1531437495, now seen corresponding path program 1 times [2022-11-25 17:07:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:58,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776297063] [2022-11-25 17:07:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:59,263 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-25 17:07:59,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:59,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776297063] [2022-11-25 17:07:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776297063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:59,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:59,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590529917] [2022-11-25 17:07:59,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:59,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:59,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:59,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-11-25 17:07:59,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:59,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:59,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-11-25 17:07:59,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:03,284 INFO L130 PetriNetUnfolder]: 22468/30629 cut-off events. [2022-11-25 17:08:03,284 INFO L131 PetriNetUnfolder]: For 22078/22078 co-relation queries the response was YES. [2022-11-25 17:08:03,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83853 conditions, 30629 events. 22468/30629 cut-off events. For 22078/22078 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 168510 event pairs, 1900 based on Foata normal form. 1089/31718 useless extension candidates. Maximal degree in co-relation 83839. Up to 15545 conditions per place. [2022-11-25 17:08:03,510 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 58 selfloop transitions, 12 changer transitions 46/116 dead transitions. [2022-11-25 17:08:03,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 660 flow [2022-11-25 17:08:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:08:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:08:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2022-11-25 17:08:03,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49800796812749004 [2022-11-25 17:08:03,515 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2022-11-25 17:08:03,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2022-11-25 17:08:03,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:03,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2022-11-25 17:08:03,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:03,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:03,525 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:03,526 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 146 flow. Second operand 7 states and 875 transitions. [2022-11-25 17:08:03,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 660 flow [2022-11-25 17:08:03,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 116 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:03,629 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 236 flow [2022-11-25 17:08:03,629 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-11-25 17:08:03,631 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-11-25 17:08:03,631 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 236 flow [2022-11-25 17:08:03,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:03,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:03,632 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:03,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:08:03,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1531438456, now seen corresponding path program 1 times [2022-11-25 17:08:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:03,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772708346] [2022-11-25 17:08:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:03,912 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-25 17:08:03,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:03,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772708346] [2022-11-25 17:08:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772708346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:03,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:03,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:08:03,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647161777] [2022-11-25 17:08:03,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:03,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:04,126 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2022-11-25 17:08:04,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:04,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:04,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2022-11-25 17:08:04,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:08,287 INFO L130 PetriNetUnfolder]: 21880/29867 cut-off events. [2022-11-25 17:08:08,287 INFO L131 PetriNetUnfolder]: For 62810/62810 co-relation queries the response was YES. [2022-11-25 17:08:08,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91972 conditions, 29867 events. 21880/29867 cut-off events. For 62810/62810 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 165335 event pairs, 4155 based on Foata normal form. 1135/31002 useless extension candidates. Maximal degree in co-relation 91952. Up to 15256 conditions per place. [2022-11-25 17:08:08,450 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 69 selfloop transitions, 18 changer transitions 48/135 dead transitions. [2022-11-25 17:08:08,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 135 transitions, 894 flow [2022-11-25 17:08:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:08:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:08:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2022-11-25 17:08:08,455 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5025611838360843 [2022-11-25 17:08:08,455 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2022-11-25 17:08:08,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2022-11-25 17:08:08,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:08,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2022-11-25 17:08:08,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:08,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:08,464 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:08,464 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 236 flow. Second operand 7 states and 883 transitions. [2022-11-25 17:08:08,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 135 transitions, 894 flow [2022-11-25 17:08:08,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 135 transitions, 886 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-25 17:08:08,925 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 410 flow [2022-11-25 17:08:08,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2022-11-25 17:08:08,926 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-11-25 17:08:08,926 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 410 flow [2022-11-25 17:08:08,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:08,927 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:08,927 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:08,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:08:08,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -229902651, now seen corresponding path program 1 times [2022-11-25 17:08:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:08,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114228200] [2022-11-25 17:08:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:09,103 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-25 17:08:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114228200] [2022-11-25 17:08:09,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114228200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:09,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:09,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:08:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535977048] [2022-11-25 17:08:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:09,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:09,116 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 251 [2022-11-25 17:08:09,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:09,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:09,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 251 [2022-11-25 17:08:09,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:12,570 INFO L130 PetriNetUnfolder]: 16162/22909 cut-off events. [2022-11-25 17:08:12,570 INFO L131 PetriNetUnfolder]: For 76738/78460 co-relation queries the response was YES. [2022-11-25 17:08:12,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73397 conditions, 22909 events. 16162/22909 cut-off events. For 76738/78460 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 136106 event pairs, 4811 based on Foata normal form. 1528/24155 useless extension candidates. Maximal degree in co-relation 73369. Up to 13906 conditions per place. [2022-11-25 17:08:12,945 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 50 selfloop transitions, 4 changer transitions 29/96 dead transitions. [2022-11-25 17:08:12,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 786 flow [2022-11-25 17:08:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:08:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-11-25 17:08:12,951 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5203187250996016 [2022-11-25 17:08:12,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2022-11-25 17:08:12,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2022-11-25 17:08:12,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:12,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2022-11-25 17:08:12,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:12,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:12,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:12,958 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 410 flow. Second operand 5 states and 653 transitions. [2022-11-25 17:08:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 786 flow [2022-11-25 17:08:13,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 772 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:13,439 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 416 flow [2022-11-25 17:08:13,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=416, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2022-11-25 17:08:13,440 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2022-11-25 17:08:13,440 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 416 flow [2022-11-25 17:08:13,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:13,441 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:13,441 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:13,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:08:13,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash -71985120, now seen corresponding path program 1 times [2022-11-25 17:08:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:13,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588803438] [2022-11-25 17:08:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:13,681 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-25 17:08:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:13,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588803438] [2022-11-25 17:08:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588803438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:13,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:13,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:08:13,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138750845] [2022-11-25 17:08:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:13,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:08:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:13,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:08:13,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:13,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-11-25 17:08:13,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:13,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:13,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-11-25 17:08:13,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:15,754 INFO L130 PetriNetUnfolder]: 7950/11774 cut-off events. [2022-11-25 17:08:15,755 INFO L131 PetriNetUnfolder]: For 30572/32203 co-relation queries the response was YES. [2022-11-25 17:08:15,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36915 conditions, 11774 events. 7950/11774 cut-off events. For 30572/32203 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 70297 event pairs, 1793 based on Foata normal form. 657/12197 useless extension candidates. Maximal degree in co-relation 36884. Up to 9798 conditions per place. [2022-11-25 17:08:15,851 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 61 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2022-11-25 17:08:15,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 82 transitions, 722 flow [2022-11-25 17:08:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:08:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:08:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2022-11-25 17:08:15,853 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5258964143426295 [2022-11-25 17:08:15,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2022-11-25 17:08:15,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2022-11-25 17:08:15,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:15,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2022-11-25 17:08:15,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:15,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:15,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:15,858 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 416 flow. Second operand 3 states and 396 transitions. [2022-11-25 17:08:15,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 82 transitions, 722 flow [2022-11-25 17:08:15,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 700 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-11-25 17:08:15,957 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 429 flow [2022-11-25 17:08:15,958 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2022-11-25 17:08:15,961 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-11-25 17:08:15,961 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 429 flow [2022-11-25 17:08:15,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:15,962 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:15,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:15,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:08:15,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1301015090, now seen corresponding path program 1 times [2022-11-25 17:08:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400250116] [2022-11-25 17:08:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:16,213 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-25 17:08:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400250116] [2022-11-25 17:08:16,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400250116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:16,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:16,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:08:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342960409] [2022-11-25 17:08:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:16,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:16,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-11-25 17:08:16,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:16,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:16,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-11-25 17:08:16,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:19,003 INFO L130 PetriNetUnfolder]: 12413/18540 cut-off events. [2022-11-25 17:08:19,003 INFO L131 PetriNetUnfolder]: For 41716/43017 co-relation queries the response was YES. [2022-11-25 17:08:19,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62385 conditions, 18540 events. 12413/18540 cut-off events. For 41716/43017 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 119129 event pairs, 5635 based on Foata normal form. 770/18936 useless extension candidates. Maximal degree in co-relation 62358. Up to 8823 conditions per place. [2022-11-25 17:08:19,144 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 62 selfloop transitions, 7 changer transitions 30/109 dead transitions. [2022-11-25 17:08:19,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 871 flow [2022-11-25 17:08:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:08:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-11-25 17:08:19,148 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5227091633466135 [2022-11-25 17:08:19,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2022-11-25 17:08:19,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2022-11-25 17:08:19,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:19,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2022-11-25 17:08:19,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:19,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:19,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:19,159 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 429 flow. Second operand 5 states and 656 transitions. [2022-11-25 17:08:19,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 871 flow [2022-11-25 17:08:19,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 109 transitions, 858 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-25 17:08:19,276 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 429 flow [2022-11-25 17:08:19,276 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-11-25 17:08:19,277 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2022-11-25 17:08:19,278 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 429 flow [2022-11-25 17:08:19,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:19,278 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:19,279 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:08:19,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 588192024, now seen corresponding path program 1 times [2022-11-25 17:08:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:19,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308443096] [2022-11-25 17:08:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:19,556 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-25 17:08:19,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:19,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308443096] [2022-11-25 17:08:19,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308443096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:19,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:19,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:08:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836667946] [2022-11-25 17:08:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:19,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:19,569 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-11-25 17:08:19,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:19,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:19,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-11-25 17:08:19,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:21,002 INFO L130 PetriNetUnfolder]: 5089/8082 cut-off events. [2022-11-25 17:08:21,002 INFO L131 PetriNetUnfolder]: For 17033/17760 co-relation queries the response was YES. [2022-11-25 17:08:21,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26674 conditions, 8082 events. 5089/8082 cut-off events. For 17033/17760 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 51085 event pairs, 1086 based on Foata normal form. 784/8679 useless extension candidates. Maximal degree in co-relation 26644. Up to 3808 conditions per place. [2022-11-25 17:08:21,068 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 80 selfloop transitions, 9 changer transitions 0/103 dead transitions. [2022-11-25 17:08:21,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 914 flow [2022-11-25 17:08:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:08:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:08:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2022-11-25 17:08:21,071 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5278884462151394 [2022-11-25 17:08:21,072 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2022-11-25 17:08:21,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2022-11-25 17:08:21,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:21,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2022-11-25 17:08:21,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:21,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:21,078 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:21,078 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 429 flow. Second operand 4 states and 530 transitions. [2022-11-25 17:08:21,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 914 flow [2022-11-25 17:08:21,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 858 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-25 17:08:21,120 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 447 flow [2022-11-25 17:08:21,120 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2022-11-25 17:08:21,121 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places. [2022-11-25 17:08:21,121 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 447 flow [2022-11-25 17:08:21,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:21,122 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:21,122 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:21,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:08:21,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1826189815, now seen corresponding path program 1 times [2022-11-25 17:08:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:21,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150362182] [2022-11-25 17:08:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:21,469 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-25 17:08:21,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:21,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150362182] [2022-11-25 17:08:21,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150362182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:21,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:21,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109244468] [2022-11-25 17:08:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:21,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-11-25 17:08:21,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 447 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:21,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:21,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-11-25 17:08:21,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:22,554 INFO L130 PetriNetUnfolder]: 3701/5860 cut-off events. [2022-11-25 17:08:22,554 INFO L131 PetriNetUnfolder]: For 11584/12067 co-relation queries the response was YES. [2022-11-25 17:08:22,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21309 conditions, 5860 events. 3701/5860 cut-off events. For 11584/12067 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35855 event pairs, 835 based on Foata normal form. 409/6098 useless extension candidates. Maximal degree in co-relation 21281. Up to 2249 conditions per place. [2022-11-25 17:08:22,583 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 94 selfloop transitions, 13 changer transitions 0/121 dead transitions. [2022-11-25 17:08:22,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 1029 flow [2022-11-25 17:08:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:08:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2022-11-25 17:08:22,587 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5274900398406375 [2022-11-25 17:08:22,587 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2022-11-25 17:08:22,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2022-11-25 17:08:22,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:22,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2022-11-25 17:08:22,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:22,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:22,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:22,594 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 447 flow. Second operand 5 states and 662 transitions. [2022-11-25 17:08:22,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 1029 flow [2022-11-25 17:08:22,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 1009 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:22,618 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 495 flow [2022-11-25 17:08:22,619 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2022-11-25 17:08:22,619 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2022-11-25 17:08:22,620 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 495 flow [2022-11-25 17:08:22,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:22,620 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:22,620 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:22,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:08:22,621 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1769471044, now seen corresponding path program 1 times [2022-11-25 17:08:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:22,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73098560] [2022-11-25 17:08:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:23,653 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-25 17:08:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:23,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73098560] [2022-11-25 17:08:23,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73098560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:23,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:23,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565026081] [2022-11-25 17:08:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:23,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:08:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:23,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:08:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:08:23,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 251 [2022-11-25 17:08:23,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 495 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:23,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:23,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 251 [2022-11-25 17:08:23,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:25,451 INFO L130 PetriNetUnfolder]: 6152/9228 cut-off events. [2022-11-25 17:08:25,452 INFO L131 PetriNetUnfolder]: For 28626/28626 co-relation queries the response was YES. [2022-11-25 17:08:25,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36850 conditions, 9228 events. 6152/9228 cut-off events. For 28626/28626 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 51420 event pairs, 372 based on Foata normal form. 17/9245 useless extension candidates. Maximal degree in co-relation 36821. Up to 3829 conditions per place. [2022-11-25 17:08:25,522 INFO L137 encePairwiseOnDemand]: 236/251 looper letters, 141 selfloop transitions, 76 changer transitions 19/236 dead transitions. [2022-11-25 17:08:25,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 236 transitions, 2068 flow [2022-11-25 17:08:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:08:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:08:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1321 transitions. [2022-11-25 17:08:25,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4784498370155741 [2022-11-25 17:08:25,528 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1321 transitions. [2022-11-25 17:08:25,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1321 transitions. [2022-11-25 17:08:25,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:25,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1321 transitions. [2022-11-25 17:08:25,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.0909090909091) internal successors, (1321), 11 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:25,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:25,542 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:25,542 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 495 flow. Second operand 11 states and 1321 transitions. [2022-11-25 17:08:25,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 236 transitions, 2068 flow [2022-11-25 17:08:25,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 236 transitions, 1966 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-11-25 17:08:25,768 INFO L231 Difference]: Finished difference. Result has 80 places, 123 transitions, 1233 flow [2022-11-25 17:08:25,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1233, PETRI_PLACES=80, PETRI_TRANSITIONS=123} [2022-11-25 17:08:25,769 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2022-11-25 17:08:25,770 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 123 transitions, 1233 flow [2022-11-25 17:08:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:25,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:25,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:08:25,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:25,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash 841449658, now seen corresponding path program 2 times [2022-11-25 17:08:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:25,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181722052] [2022-11-25 17:08:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:27,041 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-25 17:08:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:27,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181722052] [2022-11-25 17:08:27,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181722052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:27,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:27,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:08:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715284201] [2022-11-25 17:08:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:27,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:08:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:08:27,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:08:27,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251 [2022-11-25 17:08:27,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 123 transitions, 1233 flow. Second operand has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:27,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:27,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251 [2022-11-25 17:08:27,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:29,064 INFO L130 PetriNetUnfolder]: 4817/7756 cut-off events. [2022-11-25 17:08:29,064 INFO L131 PetriNetUnfolder]: For 26621/27107 co-relation queries the response was YES. [2022-11-25 17:08:29,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34229 conditions, 7756 events. 4817/7756 cut-off events. For 26621/27107 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 48638 event pairs, 944 based on Foata normal form. 220/7779 useless extension candidates. Maximal degree in co-relation 34192. Up to 5234 conditions per place. [2022-11-25 17:08:29,122 INFO L137 encePairwiseOnDemand]: 241/251 looper letters, 122 selfloop transitions, 24 changer transitions 64/240 dead transitions. [2022-11-25 17:08:29,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 240 transitions, 2356 flow [2022-11-25 17:08:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:08:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:08:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1020 transitions. [2022-11-25 17:08:29,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5079681274900398 [2022-11-25 17:08:29,127 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1020 transitions. [2022-11-25 17:08:29,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1020 transitions. [2022-11-25 17:08:29,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:29,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1020 transitions. [2022-11-25 17:08:29,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.5) internal successors, (1020), 8 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:29,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 251.0) internal successors, (2259), 9 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:29,137 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 251.0) internal successors, (2259), 9 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:29,137 INFO L175 Difference]: Start difference. First operand has 80 places, 123 transitions, 1233 flow. Second operand 8 states and 1020 transitions. [2022-11-25 17:08:29,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 240 transitions, 2356 flow [2022-11-25 17:08:29,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 240 transitions, 2329 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 17:08:29,360 INFO L231 Difference]: Finished difference. Result has 87 places, 129 transitions, 1317 flow [2022-11-25 17:08:29,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=87, PETRI_TRANSITIONS=129} [2022-11-25 17:08:29,360 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2022-11-25 17:08:29,360 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 129 transitions, 1317 flow [2022-11-25 17:08:29,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:29,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:29,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:29,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:08:29,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:29,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1006449194, now seen corresponding path program 3 times [2022-11-25 17:08:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:29,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590174495] [2022-11-25 17:08:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:30,089 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-25 17:08:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590174495] [2022-11-25 17:08:30,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590174495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:30,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:30,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:08:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882669830] [2022-11-25 17:08:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:30,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:08:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:08:30,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:08:30,159 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2022-11-25 17:08:30,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 129 transitions, 1317 flow. Second operand has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:30,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:30,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2022-11-25 17:08:30,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:32,231 INFO L130 PetriNetUnfolder]: 7481/11484 cut-off events. [2022-11-25 17:08:32,231 INFO L131 PetriNetUnfolder]: For 54005/54005 co-relation queries the response was YES. [2022-11-25 17:08:32,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55955 conditions, 11484 events. 7481/11484 cut-off events. For 54005/54005 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 69626 event pairs, 791 based on Foata normal form. 17/11501 useless extension candidates. Maximal degree in co-relation 55914. Up to 3917 conditions per place. [2022-11-25 17:08:32,329 INFO L137 encePairwiseOnDemand]: 235/251 looper letters, 182 selfloop transitions, 117 changer transitions 35/334 dead transitions. [2022-11-25 17:08:32,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 334 transitions, 3521 flow [2022-11-25 17:08:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:08:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 17:08:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1198 transitions. [2022-11-25 17:08:32,336 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47729083665338645 [2022-11-25 17:08:32,336 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1198 transitions. [2022-11-25 17:08:32,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1198 transitions. [2022-11-25 17:08:32,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:32,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1198 transitions. [2022-11-25 17:08:32,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.8) internal successors, (1198), 10 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:32,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 251.0) internal successors, (2761), 11 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:32,346 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 251.0) internal successors, (2761), 11 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:32,346 INFO L175 Difference]: Start difference. First operand has 87 places, 129 transitions, 1317 flow. Second operand 10 states and 1198 transitions. [2022-11-25 17:08:32,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 334 transitions, 3521 flow [2022-11-25 17:08:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 334 transitions, 3308 flow, removed 56 selfloop flow, removed 7 redundant places. [2022-11-25 17:08:32,768 INFO L231 Difference]: Finished difference. Result has 93 places, 185 transitions, 2262 flow [2022-11-25 17:08:32,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2262, PETRI_PLACES=93, PETRI_TRANSITIONS=185} [2022-11-25 17:08:32,770 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2022-11-25 17:08:32,770 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 185 transitions, 2262 flow [2022-11-25 17:08:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:32,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:32,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:32,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:08:32,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1209553634, now seen corresponding path program 4 times [2022-11-25 17:08:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:32,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288421930] [2022-11-25 17:08:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:33,031 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-25 17:08:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:33,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288421930] [2022-11-25 17:08:33,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288421930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:33,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:33,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912340782] [2022-11-25 17:08:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:33,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:08:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:08:33,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:08:33,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 251 [2022-11-25 17:08:33,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 185 transitions, 2262 flow. Second operand has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:33,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:33,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 251 [2022-11-25 17:08:33,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:34,706 INFO L130 PetriNetUnfolder]: 5727/9113 cut-off events. [2022-11-25 17:08:34,706 INFO L131 PetriNetUnfolder]: For 57626/58182 co-relation queries the response was YES. [2022-11-25 17:08:34,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48276 conditions, 9113 events. 5727/9113 cut-off events. For 57626/58182 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 60629 event pairs, 425 based on Foata normal form. 319/9265 useless extension candidates. Maximal degree in co-relation 48241. Up to 3575 conditions per place. [2022-11-25 17:08:34,789 INFO L137 encePairwiseOnDemand]: 245/251 looper letters, 236 selfloop transitions, 17 changer transitions 45/342 dead transitions. [2022-11-25 17:08:34,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 342 transitions, 4552 flow [2022-11-25 17:08:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:08:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:08:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2022-11-25 17:08:34,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5172642762284196 [2022-11-25 17:08:34,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2022-11-25 17:08:34,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2022-11-25 17:08:34,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:34,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2022-11-25 17:08:34,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:34,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:34,800 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:34,801 INFO L175 Difference]: Start difference. First operand has 93 places, 185 transitions, 2262 flow. Second operand 6 states and 779 transitions. [2022-11-25 17:08:34,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 342 transitions, 4552 flow [2022-11-25 17:08:35,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 342 transitions, 4343 flow, removed 98 selfloop flow, removed 4 redundant places. [2022-11-25 17:08:35,551 INFO L231 Difference]: Finished difference. Result has 93 places, 163 transitions, 1919 flow [2022-11-25 17:08:35,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1919, PETRI_PLACES=93, PETRI_TRANSITIONS=163} [2022-11-25 17:08:35,552 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2022-11-25 17:08:35,552 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 163 transitions, 1919 flow [2022-11-25 17:08:35,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:35,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:35,553 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:08:35,553 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1415043404, now seen corresponding path program 1 times [2022-11-25 17:08:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:35,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233365105] [2022-11-25 17:08:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:35,821 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-25 17:08:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233365105] [2022-11-25 17:08:35,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233365105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:35,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:35,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442094365] [2022-11-25 17:08:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:35,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:35,840 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 251 [2022-11-25 17:08:35,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 163 transitions, 1919 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:35,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:35,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 251 [2022-11-25 17:08:35,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:37,201 INFO L130 PetriNetUnfolder]: 3945/6294 cut-off events. [2022-11-25 17:08:37,201 INFO L131 PetriNetUnfolder]: For 39788/39900 co-relation queries the response was YES. [2022-11-25 17:08:37,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34757 conditions, 6294 events. 3945/6294 cut-off events. For 39788/39900 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37867 event pairs, 525 based on Foata normal form. 33/6265 useless extension candidates. Maximal degree in co-relation 34715. Up to 2741 conditions per place. [2022-11-25 17:08:37,246 INFO L137 encePairwiseOnDemand]: 247/251 looper letters, 96 selfloop transitions, 1 changer transitions 179/296 dead transitions. [2022-11-25 17:08:37,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 296 transitions, 3768 flow [2022-11-25 17:08:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:08:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-11-25 17:08:37,249 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5059760956175299 [2022-11-25 17:08:37,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-11-25 17:08:37,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-11-25 17:08:37,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:37,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-11-25 17:08:37,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:37,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:37,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:37,255 INFO L175 Difference]: Start difference. First operand has 93 places, 163 transitions, 1919 flow. Second operand 5 states and 635 transitions. [2022-11-25 17:08:37,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 296 transitions, 3768 flow [2022-11-25 17:08:37,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 296 transitions, 3555 flow, removed 58 selfloop flow, removed 7 redundant places. [2022-11-25 17:08:37,463 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 1062 flow [2022-11-25 17:08:37,463 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1062, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2022-11-25 17:08:37,464 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2022-11-25 17:08:37,464 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 1062 flow [2022-11-25 17:08:37,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:37,465 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:37,465 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:37,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:08:37,465 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1629114300, now seen corresponding path program 2 times [2022-11-25 17:08:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:37,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465923624] [2022-11-25 17:08:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:38,373 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-25 17:08:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:38,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465923624] [2022-11-25 17:08:38,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465923624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:38,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:38,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:08:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274174980] [2022-11-25 17:08:38,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:38,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:08:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:08:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:08:38,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 251 [2022-11-25 17:08:38,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 1062 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:38,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:38,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 251 [2022-11-25 17:08:38,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:39,212 INFO L130 PetriNetUnfolder]: 1471/2521 cut-off events. [2022-11-25 17:08:39,212 INFO L131 PetriNetUnfolder]: For 13081/13150 co-relation queries the response was YES. [2022-11-25 17:08:39,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12647 conditions, 2521 events. 1471/2521 cut-off events. For 13081/13150 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13833 event pairs, 216 based on Foata normal form. 45/2541 useless extension candidates. Maximal degree in co-relation 12615. Up to 1581 conditions per place. [2022-11-25 17:08:39,227 INFO L137 encePairwiseOnDemand]: 244/251 looper letters, 75 selfloop transitions, 7 changer transitions 63/156 dead transitions. [2022-11-25 17:08:39,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 156 transitions, 1667 flow [2022-11-25 17:08:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:08:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:08:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2022-11-25 17:08:39,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4805776892430279 [2022-11-25 17:08:39,231 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 965 transitions. [2022-11-25 17:08:39,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 965 transitions. [2022-11-25 17:08:39,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:39,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 965 transitions. [2022-11-25 17:08:39,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:39,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 251.0) internal successors, (2259), 9 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:39,237 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 251.0) internal successors, (2259), 9 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:39,237 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 1062 flow. Second operand 8 states and 965 transitions. [2022-11-25 17:08:39,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 156 transitions, 1667 flow [2022-11-25 17:08:39,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 156 transitions, 1598 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-11-25 17:08:39,282 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 709 flow [2022-11-25 17:08:39,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=709, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2022-11-25 17:08:39,282 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2022-11-25 17:08:39,282 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 709 flow [2022-11-25 17:08:39,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:39,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:39,284 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:39,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:08:39,284 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:08:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1602753180, now seen corresponding path program 3 times [2022-11-25 17:08:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:39,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472138776] [2022-11-25 17:08:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:08:39,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:08:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:08:39,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:08:39,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:08:39,478 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 17:08:39,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 17:08:39,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 17:08:39,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 17:08:39,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 17:08:39,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 17:08:39,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 17:08:39,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:08:39,487 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:39,494 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:08:39,495 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:08:39,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:08:39 BasicIcfg [2022-11-25 17:08:39,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:08:39,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:08:39,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:08:39,619 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:08:39,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:45" (3/4) ... [2022-11-25 17:08:39,622 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:08:39,736 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:08:39,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:08:39,737 INFO L158 Benchmark]: Toolchain (without parser) took 56200.92ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 117.2MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2022-11-25 17:08:39,738 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 79.1MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:08:39,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 738.94ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 88.7MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:08:39,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.69ms. Allocated memory is still 155.2MB. Free memory was 88.7MB in the beginning and 86.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:08:39,739 INFO L158 Benchmark]: Boogie Preprocessor took 86.61ms. Allocated memory is still 155.2MB. Free memory was 86.1MB in the beginning and 126.6MB in the end (delta: -40.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-11-25 17:08:39,739 INFO L158 Benchmark]: RCFGBuilder took 894.27ms. Allocated memory is still 155.2MB. Free memory was 126.6MB in the beginning and 89.0MB in the end (delta: 37.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 17:08:39,740 INFO L158 Benchmark]: TraceAbstraction took 54261.47ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 88.3MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2022-11-25 17:08:39,740 INFO L158 Benchmark]: Witness Printer took 117.82ms. Allocated memory is still 7.2GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:08:39,743 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 79.1MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 738.94ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 88.7MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.69ms. Allocated memory is still 155.2MB. Free memory was 88.7MB in the beginning and 86.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.61ms. Allocated memory is still 155.2MB. Free memory was 86.1MB in the beginning and 126.6MB in the end (delta: -40.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 894.27ms. Allocated memory is still 155.2MB. Free memory was 126.6MB in the beginning and 89.0MB in the end (delta: 37.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 54261.47ms. Allocated memory was 155.2MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 88.3MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 117.82ms. Allocated memory is still 7.2GB. Free memory was 3.4GB in the beginning and 3.4GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 144 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 32 TransitionsAfterwards, 3404 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 9799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4746, independent: 4510, independent conditional: 0, independent unconditional: 4510, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2488, independent: 2426, independent conditional: 0, independent unconditional: 2426, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2488, independent: 2395, independent conditional: 0, independent unconditional: 2395, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 519, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 472, dependent conditional: 0, dependent unconditional: 472, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4746, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 2488, unknown conditional: 0, unknown unconditional: 2488] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 280, Positive conditional cache size: 0, Positive unconditional cache size: 280, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=-3, t713={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=-2, t713={5:0}, t714={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t715; [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=-1, t713={5:0}, t714={6:0}, t715={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=0, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=2] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=255, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, 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: 865]: 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: 871]: 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: 869]: 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: 867]: 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: 53.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1150 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1005 mSDsluCounter, 835 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3086 IncrementalHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 79 mSDtfsCounter, 3086 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2262occurred in iteration=12, InterpolantAutomatonStates: 92, 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.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 2074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-25 17:08:39,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0af0af5e-3477-4b34-a789-69faa8dfda04/bin/uautomizer-ZsLfNo2U6R/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