./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8 --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 a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --- 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-2329fc7 [2022-12-13 15:04:09,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:04:09,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:04:09,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:04:09,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:04:09,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:04:09,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:04:09,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:04:09,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:04:09,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:04:09,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:04:09,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:04:09,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:04:09,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:04:09,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:04:09,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:04:09,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:04:09,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:04:09,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:04:09,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:04:09,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:04:09,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:04:09,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:04:09,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:04:09,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:04:09,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:04:09,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:04:09,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:04:09,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:04:09,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:04:09,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:04:09,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:04:09,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:04:09,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:04:09,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:04:09,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:04:09,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:04:09,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:04:09,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:04:09,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:04:09,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:04:09,412 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 15:04:09,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:04:09,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:04:09,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:04:09,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:04:09,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:04:09,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:04:09,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:04:09,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:04:09,442 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:04:09,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:04:09,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:04:09,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:04:09,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:04:09,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:04:09,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:04:09,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:04:09,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:04:09,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:04:09,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:04:09,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:04:09,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:04:09,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:04:09,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:04:09,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:04:09,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:04:09,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:04:09,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:04:09,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:04:09,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:04:09,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:04:09,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:04:09,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:04:09,446 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:04:09,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:04:09,447 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:04:09,447 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_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/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_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8 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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 [2022-12-13 15:04:09,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:04:09,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:04:09,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:04:09,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:04:09,678 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:04:09,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:04:12,244 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:04:12,402 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:04:12,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:04:12,412 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/data/11136494e/2e8dc33a7e024389bf8b4c03c3e01714/FLAG99dfb2f6c [2022-12-13 15:04:12,423 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/data/11136494e/2e8dc33a7e024389bf8b4c03c3e01714 [2022-12-13 15:04:12,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:04:12,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:04:12,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:04:12,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:04:12,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:04:12,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67508edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12, skipping insertion in model container [2022-12-13 15:04:12,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:04:12,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:04:12,572 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_1aed290b-415c-4232-bbd5-f9d835821db1/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:04:12,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:04:12,717 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:04:12,725 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_1aed290b-415c-4232-bbd5-f9d835821db1/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 15:04:12,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:04:12,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:04:12,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:04:12,786 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:04:12,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12 WrapperNode [2022-12-13 15:04:12,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:04:12,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:04:12,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:04:12,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:04:12,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,821 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 15:04:12,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:04:12,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:04:12,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:04:12,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:04:12,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,841 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:04:12,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:04:12,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:04:12,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:04:12,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (1/1) ... [2022-12-13 15:04:12,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:04:12,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:12,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:12,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:04:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:04:12,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:04:12,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:04:12,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:04:12,897 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 15:04:12,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 15:04:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:04:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:04:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:04:12,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:04:12,899 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 15:04:13,037 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:04:13,039 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:04:13,310 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:04:13,394 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:04:13,394 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:04:13,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:04:13 BoogieIcfgContainer [2022-12-13 15:04:13,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:04:13,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:04:13,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:04:13,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:04:13,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:04:12" (1/3) ... [2022-12-13 15:04:13,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd3d76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:04:13, skipping insertion in model container [2022-12-13 15:04:13,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:12" (2/3) ... [2022-12-13 15:04:13,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd3d76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:04:13, skipping insertion in model container [2022-12-13 15:04:13,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:04:13" (3/3) ... [2022-12-13 15:04:13,402 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 15:04:13,409 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 15:04:13,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:04:13,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 15:04:13,416 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:04:13,459 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:04:13,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-12-13 15:04:13,539 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-12-13 15:04:13,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:04:13,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-13 15:04:13,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-12-13 15:04:13,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-12-13 15:04:13,552 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:04:13,562 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2022-12-13 15:04:13,565 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2022-12-13 15:04:13,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2022-12-13 15:04:13,595 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-12-13 15:04:13,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:04:13,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-13 15:04:13,598 INFO L119 LiptonReduction]: Number of co-enabled transitions 3548 [2022-12-13 15:04:16,625 INFO L134 LiptonReduction]: Checked pairs total: 9758 [2022-12-13 15:04:16,625 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-12-13 15:04:16,635 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:04:16,639 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;@18d48d93, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:04:16,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 15:04:16,641 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 15:04:16,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:04:16,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:16,642 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:04:16,642 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-12-13 15:04:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash 576085, now seen corresponding path program 1 times [2022-12-13 15:04:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:16,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730814527] [2022-12-13 15:04:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:16,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730814527] [2022-12-13 15:04:16,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730814527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:16,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:16,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:04:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658396365] [2022-12-13 15:04:16,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:16,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:04:16,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:04:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:04:16,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 257 [2022-12-13 15:04:16,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:16,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:16,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 257 [2022-12-13 15:04:16,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:17,706 INFO L130 PetriNetUnfolder]: 4903/6758 cut-off events. [2022-12-13 15:04:17,706 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-13 15:04:17,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13606 conditions, 6758 events. 4903/6758 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33780 event pairs, 2535 based on Foata normal form. 0/6420 useless extension candidates. Maximal degree in co-relation 13594. Up to 5335 conditions per place. [2022-12-13 15:04:17,735 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-12-13 15:04:17,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2022-12-13 15:04:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:04:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:04:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-12-13 15:04:17,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5447470817120622 [2022-12-13 15:04:17,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2022-12-13 15:04:17,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2022-12-13 15:04:17,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:17,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2022-12-13 15:04:17,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:17,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:17,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:17,763 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 420 transitions. [2022-12-13 15:04:17,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2022-12-13 15:04:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 15:04:17,768 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-12-13 15:04:17,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, 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-12-13 15:04:17,774 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-12-13 15:04:17,774 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-12-13 15:04:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:17,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:17,775 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:17,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:04:17,775 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-12-13 15:04:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash -537101506, now seen corresponding path program 1 times [2022-12-13 15:04:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:17,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699167574] [2022-12-13 15:04:17,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:17,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699167574] [2022-12-13 15:04:17,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699167574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:17,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:17,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:04:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374615898] [2022-12-13 15:04:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:17,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:04:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:04:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:04:17,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 15:04:17,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:17,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:17,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 15:04:17,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:19,959 INFO L130 PetriNetUnfolder]: 17583/23844 cut-off events. [2022-12-13 15:04:19,959 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-12-13 15:04:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49052 conditions, 23844 events. 17583/23844 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 126523 event pairs, 6559 based on Foata normal form. 548/24392 useless extension candidates. Maximal degree in co-relation 49042. Up to 16827 conditions per place. [2022-12-13 15:04:20,051 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-13 15:04:20,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-13 15:04:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:04:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:04:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2022-12-13 15:04:20,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5097276264591439 [2022-12-13 15:04:20,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2022-12-13 15:04:20,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2022-12-13 15:04:20,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:20,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2022-12-13 15:04:20,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:20,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:20,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:20,056 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 393 transitions. [2022-12-13 15:04:20,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-13 15:04:20,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:04:20,058 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2022-12-13 15:04:20,058 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, 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=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-13 15:04:20,059 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2022-12-13 15:04:20,059 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2022-12-13 15:04:20,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:20,059 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:20,059 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:20,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:04:20,060 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-12-13 15:04:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 529720247, now seen corresponding path program 1 times [2022-12-13 15:04:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:20,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169779962] [2022-12-13 15:04:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:20,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169779962] [2022-12-13 15:04:20,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169779962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:20,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:20,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:04:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297403033] [2022-12-13 15:04:20,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:20,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:04:20,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:04:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:04:20,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 15:04:20,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:20,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:20,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 15:04:20,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:21,931 INFO L130 PetriNetUnfolder]: 16247/22060 cut-off events. [2022-12-13 15:04:21,931 INFO L131 PetriNetUnfolder]: For 8542/8542 co-relation queries the response was YES. [2022-12-13 15:04:21,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54632 conditions, 22060 events. 16247/22060 cut-off events. For 8542/8542 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 111143 event pairs, 4719 based on Foata normal form. 280/22340 useless extension candidates. Maximal degree in co-relation 54620. Up to 11031 conditions per place. [2022-12-13 15:04:21,997 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-13 15:04:21,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 348 flow [2022-12-13 15:04:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:04:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:04:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2022-12-13 15:04:21,998 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4990272373540856 [2022-12-13 15:04:21,998 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2022-12-13 15:04:21,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2022-12-13 15:04:21,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:21,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2022-12-13 15:04:21,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:22,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:22,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:22,001 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 128 flow. Second operand 4 states and 513 transitions. [2022-12-13 15:04:22,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 348 flow [2022-12-13 15:04:22,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:04:22,046 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2022-12-13 15:04:22,046 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-13 15:04:22,047 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-12-13 15:04:22,047 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2022-12-13 15:04:22,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:22,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:22,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:22,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:04:22,048 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-12-13 15:04:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:22,048 INFO L85 PathProgramCache]: Analyzing trace with hash -760931677, now seen corresponding path program 1 times [2022-12-13 15:04:22,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:22,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443730267] [2022-12-13 15:04:22,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:22,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:22,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443730267] [2022-12-13 15:04:22,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443730267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:22,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:22,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:04:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659989985] [2022-12-13 15:04:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:22,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:04:22,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:22,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:04:22,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:04:22,229 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 15:04:22,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:22,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:22,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 15:04:22,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:24,189 INFO L130 PetriNetUnfolder]: 15972/21685 cut-off events. [2022-12-13 15:04:24,189 INFO L131 PetriNetUnfolder]: For 14519/14519 co-relation queries the response was YES. [2022-12-13 15:04:24,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56996 conditions, 21685 events. 15972/21685 cut-off events. For 14519/14519 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 113044 event pairs, 4148 based on Foata normal form. 40/21725 useless extension candidates. Maximal degree in co-relation 56981. Up to 14726 conditions per place. [2022-12-13 15:04:24,264 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 63 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2022-12-13 15:04:24,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 468 flow [2022-12-13 15:04:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:04:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:04:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-12-13 15:04:24,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5097276264591439 [2022-12-13 15:04:24,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2022-12-13 15:04:24,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2022-12-13 15:04:24,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:24,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2022-12-13 15:04:24,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:24,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:24,268 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:24,268 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 4 states and 524 transitions. [2022-12-13 15:04:24,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 468 flow [2022-12-13 15:04:24,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:04:24,295 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 279 flow [2022-12-13 15:04:24,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-13 15:04:24,296 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2022-12-13 15:04:24,296 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 279 flow [2022-12-13 15:04:24,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:24,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:24,297 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:04:24,297 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-12-13 15:04:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2114024508, now seen corresponding path program 1 times [2022-12-13 15:04:24,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:24,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652042899] [2022-12-13 15:04:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:24,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652042899] [2022-12-13 15:04:24,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652042899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:24,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:24,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:04:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825177498] [2022-12-13 15:04:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:24,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:04:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:24,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:04:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:04:24,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2022-12-13 15:04:24,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:24,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:24,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2022-12-13 15:04:24,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:25,659 INFO L130 PetriNetUnfolder]: 10886/15776 cut-off events. [2022-12-13 15:04:25,659 INFO L131 PetriNetUnfolder]: For 15343/15816 co-relation queries the response was YES. [2022-12-13 15:04:25,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42319 conditions, 15776 events. 10886/15776 cut-off events. For 15343/15816 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 95574 event pairs, 3407 based on Foata normal form. 344/15611 useless extension candidates. Maximal degree in co-relation 42301. Up to 9842 conditions per place. [2022-12-13 15:04:25,732 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 45 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2022-12-13 15:04:25,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 426 flow [2022-12-13 15:04:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:04:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:04:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2022-12-13 15:04:25,734 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5330739299610895 [2022-12-13 15:04:25,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2022-12-13 15:04:25,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2022-12-13 15:04:25,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:25,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2022-12-13 15:04:25,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:25,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:25,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:25,736 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 279 flow. Second operand 3 states and 411 transitions. [2022-12-13 15:04:25,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 426 flow [2022-12-13 15:04:25,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 426 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:04:25,848 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 293 flow [2022-12-13 15:04:25,848 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-13 15:04:25,849 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-12-13 15:04:25,849 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 293 flow [2022-12-13 15:04:25,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:25,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:25,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:25,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:04:25,849 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-12-13 15:04:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1337766497, now seen corresponding path program 1 times [2022-12-13 15:04:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:25,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130549724] [2022-12-13 15:04:25,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130549724] [2022-12-13 15:04:25,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130549724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:25,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:25,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:04:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287697356] [2022-12-13 15:04:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:25,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:04:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:04:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:04:25,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-12-13 15:04:25,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:25,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:25,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-12-13 15:04:25,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:27,449 INFO L130 PetriNetUnfolder]: 9213/13714 cut-off events. [2022-12-13 15:04:27,450 INFO L131 PetriNetUnfolder]: For 10834/11470 co-relation queries the response was YES. [2022-12-13 15:04:27,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35053 conditions, 13714 events. 9213/13714 cut-off events. For 10834/11470 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 86929 event pairs, 1757 based on Foata normal form. 1229/14518 useless extension candidates. Maximal degree in co-relation 35032. Up to 8207 conditions per place. [2022-12-13 15:04:27,505 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 76 selfloop transitions, 10 changer transitions 2/106 dead transitions. [2022-12-13 15:04:27,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 106 transitions, 708 flow [2022-12-13 15:04:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:04:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:04:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2022-12-13 15:04:27,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5073929961089494 [2022-12-13 15:04:27,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2022-12-13 15:04:27,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2022-12-13 15:04:27,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:27,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2022-12-13 15:04:27,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:27,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:27,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:27,512 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 293 flow. Second operand 5 states and 652 transitions. [2022-12-13 15:04:27,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 106 transitions, 708 flow [2022-12-13 15:04:27,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 106 transitions, 698 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 15:04:27,531 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 358 flow [2022-12-13 15:04:27,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2022-12-13 15:04:27,532 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2022-12-13 15:04:27,532 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 358 flow [2022-12-13 15:04:27,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:27,532 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:27,532 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:27,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:04:27,532 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-12-13 15:04:27,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash 835596847, now seen corresponding path program 1 times [2022-12-13 15:04:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:27,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941690142] [2022-12-13 15:04:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:27,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941690142] [2022-12-13 15:04:27,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941690142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:27,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:27,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:04:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355709075] [2022-12-13 15:04:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:27,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:04:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:04:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:04:27,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-12-13 15:04:27,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:27,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:27,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-12-13 15:04:27,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:29,244 INFO L130 PetriNetUnfolder]: 7517/11520 cut-off events. [2022-12-13 15:04:29,244 INFO L131 PetriNetUnfolder]: For 12536/13058 co-relation queries the response was YES. [2022-12-13 15:04:29,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36782 conditions, 11520 events. 7517/11520 cut-off events. For 12536/13058 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 74901 event pairs, 1027 based on Foata normal form. 821/11993 useless extension candidates. Maximal degree in co-relation 36758. Up to 3525 conditions per place. [2022-12-13 15:04:29,295 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 107 selfloop transitions, 19 changer transitions 1/145 dead transitions. [2022-12-13 15:04:29,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 145 transitions, 1037 flow [2022-12-13 15:04:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:04:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:04:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2022-12-13 15:04:29,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5086158977209561 [2022-12-13 15:04:29,298 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2022-12-13 15:04:29,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2022-12-13 15:04:29,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:29,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2022-12-13 15:04:29,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:29,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:29,301 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:29,301 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 358 flow. Second operand 7 states and 915 transitions. [2022-12-13 15:04:29,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 145 transitions, 1037 flow [2022-12-13 15:04:29,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 145 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:04:29,356 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 487 flow [2022-12-13 15:04:29,356 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2022-12-13 15:04:29,357 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2022-12-13 15:04:29,357 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 487 flow [2022-12-13 15:04:29,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:29,357 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:29,357 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] [2022-12-13 15:04:29,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:04:29,357 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-12-13 15:04:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -316619970, now seen corresponding path program 1 times [2022-12-13 15:04:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:29,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409451937] [2022-12-13 15:04:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:29,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409451937] [2022-12-13 15:04:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409451937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:29,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:04:29,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372971076] [2022-12-13 15:04:29,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:29,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:04:29,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:04:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:04:29,541 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-12-13 15:04:29,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:29,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:29,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-12-13 15:04:29,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:30,735 INFO L130 PetriNetUnfolder]: 7026/10767 cut-off events. [2022-12-13 15:04:30,735 INFO L131 PetriNetUnfolder]: For 20198/20702 co-relation queries the response was YES. [2022-12-13 15:04:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39630 conditions, 10767 events. 7026/10767 cut-off events. For 20198/20702 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 69769 event pairs, 908 based on Foata normal form. 353/10782 useless extension candidates. Maximal degree in co-relation 39602. Up to 3376 conditions per place. [2022-12-13 15:04:30,782 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 120 selfloop transitions, 28 changer transitions 12/178 dead transitions. [2022-12-13 15:04:30,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 178 transitions, 1380 flow [2022-12-13 15:04:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:04:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 15:04:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1176 transitions. [2022-12-13 15:04:30,785 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5084306095979247 [2022-12-13 15:04:30,785 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1176 transitions. [2022-12-13 15:04:30,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1176 transitions. [2022-12-13 15:04:30,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:30,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1176 transitions. [2022-12-13 15:04:30,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.66666666666666) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:30,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:30,789 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:30,789 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 487 flow. Second operand 9 states and 1176 transitions. [2022-12-13 15:04:30,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 178 transitions, 1380 flow [2022-12-13 15:04:31,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 178 transitions, 1330 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-13 15:04:31,502 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 615 flow [2022-12-13 15:04:31,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=615, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2022-12-13 15:04:31,502 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2022-12-13 15:04:31,502 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 615 flow [2022-12-13 15:04:31,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:31,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:31,503 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-12-13 15:04:31,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:04:31,503 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-12-13 15:04:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -415872969, now seen corresponding path program 1 times [2022-12-13 15:04:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:31,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241016438] [2022-12-13 15:04:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:31,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:32,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241016438] [2022-12-13 15:04:32,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241016438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:32,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:32,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:04:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897982702] [2022-12-13 15:04:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:32,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:04:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:04:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:04:32,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2022-12-13 15:04:32,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 615 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:32,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:32,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2022-12-13 15:04:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:33,584 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][80], [Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 164#true, 86#L878-3true, 210#(<= ~__unbuffered_cnt~0 1), Black: 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 231#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256))) (not (<= (+ (div ~a$r_buff0_thd2~0 256) 1) 0)) (= ~a~0 ~a$w_buff0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 21#L798true, Black: 211#(<= ~__unbuffered_cnt~0 2), Black: 218#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 172#true, 62#L847true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 197#(<= ~__unbuffered_cnt~0 1), 115#L811true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 174#(= ~x~0 0), 112#P0EXITtrue, Black: 181#(= ~__unbuffered_p1_EAX~0 0), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-12-13 15:04:33,584 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 15:04:33,584 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:04:33,584 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:04:33,584 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 15:04:33,777 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][80], [Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 164#true, Black: 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 197#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 231#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256))) (not (<= (+ (div ~a$r_buff0_thd2~0 256) 1) 0)) (= ~a~0 ~a$w_buff0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 21#L798true, Black: 211#(<= ~__unbuffered_cnt~0 2), Black: 218#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 68#L3true, Black: 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 172#true, 62#L847true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 115#L811true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 174#(= ~x~0 0), 112#P0EXITtrue, Black: 181#(= ~__unbuffered_p1_EAX~0 0), 216#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-12-13 15:04:33,777 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,777 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,777 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,777 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,778 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][80], [Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 164#true, 86#L878-3true, Black: 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 118#P1EXITtrue, Black: 197#(<= ~__unbuffered_cnt~0 1), Black: 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 211#(<= ~__unbuffered_cnt~0 2), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 231#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256))) (not (<= (+ (div ~a$r_buff0_thd2~0 256) 1) 0)) (= ~a~0 ~a$w_buff0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 218#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 172#true, 62#L847true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 115#L811true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 174#(= ~x~0 0), 112#P0EXITtrue, Black: 181#(= ~__unbuffered_p1_EAX~0 0), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-12-13 15:04:33,778 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,778 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,778 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,778 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 15:04:33,953 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][80], [Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 164#true, 218#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 118#P1EXITtrue, Black: 197#(<= ~__unbuffered_cnt~0 1), Black: 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 231#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256))) (not (<= (+ (div ~a$r_buff0_thd2~0 256) 1) 0)) (= ~a~0 ~a$w_buff0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 211#(<= ~__unbuffered_cnt~0 2), 68#L3true, Black: 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 172#true, 62#L847true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 115#L811true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 174#(= ~x~0 0), 112#P0EXITtrue, Black: 181#(= ~__unbuffered_p1_EAX~0 0), 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-12-13 15:04:33,953 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,953 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,953 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,953 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,954 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L831-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse5 (and .cse9 .cse7))) (let ((.cse8 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_149 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse0 (or .cse3 .cse11 .cse5)) (.cse1 (and .cse10 (not .cse11)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$flush_delayed~0_25 0) (= (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse6) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse8 .cse9) .cse4 .cse5) v_~a$r_buff0_thd4~0_62 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_5) (= (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][80], [Black: 186#(<= ~__unbuffered_cnt~0 0), Black: 187#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 164#true, Black: 198#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 118#P1EXITtrue, 218#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 197#(<= ~__unbuffered_cnt~0 1), Black: 202#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 231#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff1_used~0 256) 1)) (<= ~a$r_buff0_thd2~0 (* (div ~a$r_buff0_thd2~0 256) 256)) (= ~a$w_buff0~0 1) (<= ~a$w_buff1_used~0 (* 256 (div ~a$w_buff1_used~0 256))) (not (<= (+ (div ~a$r_buff0_thd2~0 256) 1) 0)) (= ~a~0 ~a$w_buff0~0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 211#(<= ~__unbuffered_cnt~0 2), 68#L3true, Black: 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 160#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 172#true, 62#L847true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 167#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 115#L811true, Black: 175#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 174#(= ~x~0 0), 112#P0EXITtrue, Black: 181#(= ~__unbuffered_p1_EAX~0 0), Black: 189#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-12-13 15:04:33,954 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,954 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,954 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 15:04:33,954 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 15:04:34,232 INFO L130 PetriNetUnfolder]: 12278/19508 cut-off events. [2022-12-13 15:04:34,232 INFO L131 PetriNetUnfolder]: For 54428/55000 co-relation queries the response was YES. [2022-12-13 15:04:34,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75656 conditions, 19508 events. 12278/19508 cut-off events. For 54428/55000 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 144497 event pairs, 1706 based on Foata normal form. 128/19246 useless extension candidates. Maximal degree in co-relation 75625. Up to 7175 conditions per place. [2022-12-13 15:04:34,336 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 166 selfloop transitions, 9 changer transitions 45/238 dead transitions. [2022-12-13 15:04:34,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 238 transitions, 2418 flow [2022-12-13 15:04:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:04:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:04:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2022-12-13 15:04:34,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5259403372243839 [2022-12-13 15:04:34,338 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2022-12-13 15:04:34,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2022-12-13 15:04:34,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:34,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2022-12-13 15:04:34,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:34,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:34,341 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:34,341 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 615 flow. Second operand 6 states and 811 transitions. [2022-12-13 15:04:34,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 238 transitions, 2418 flow [2022-12-13 15:04:36,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 238 transitions, 1981 flow, removed 154 selfloop flow, removed 4 redundant places. [2022-12-13 15:04:36,933 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 603 flow [2022-12-13 15:04:36,933 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=603, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2022-12-13 15:04:36,933 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2022-12-13 15:04:36,933 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 603 flow [2022-12-13 15:04:36,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:36,934 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:36,934 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] [2022-12-13 15:04:36,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:04:36,934 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-12-13 15:04:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1294097476, now seen corresponding path program 1 times [2022-12-13 15:04:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487734595] [2022-12-13 15:04:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:37,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487734595] [2022-12-13 15:04:37,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487734595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:37,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:37,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:04:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833387482] [2022-12-13 15:04:37,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:37,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:04:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:04:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:04:37,065 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 15:04:37,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:37,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:37,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 15:04:37,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:40,054 INFO L130 PetriNetUnfolder]: 23224/34062 cut-off events. [2022-12-13 15:04:40,054 INFO L131 PetriNetUnfolder]: For 78203/78203 co-relation queries the response was YES. [2022-12-13 15:04:40,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134889 conditions, 34062 events. 23224/34062 cut-off events. For 78203/78203 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 224234 event pairs, 6023 based on Foata normal form. 25/34087 useless extension candidates. Maximal degree in co-relation 134854. Up to 19567 conditions per place. [2022-12-13 15:04:40,192 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 87 selfloop transitions, 11 changer transitions 47/145 dead transitions. [2022-12-13 15:04:40,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 145 transitions, 1278 flow [2022-12-13 15:04:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:04:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:04:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-12-13 15:04:40,195 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5038910505836576 [2022-12-13 15:04:40,195 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2022-12-13 15:04:40,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2022-12-13 15:04:40,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:40,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2022-12-13 15:04:40,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:40,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:40,197 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:40,197 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 603 flow. Second operand 4 states and 518 transitions. [2022-12-13 15:04:40,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 145 transitions, 1278 flow [2022-12-13 15:04:44,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 145 transitions, 1265 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:04:44,121 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 469 flow [2022-12-13 15:04:44,122 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2022-12-13 15:04:44,122 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2022-12-13 15:04:44,122 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 469 flow [2022-12-13 15:04:44,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:44,122 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:44,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, 1, 1, 1, 1] [2022-12-13 15:04:44,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:04:44,122 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-12-13 15:04:44,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:44,123 INFO L85 PathProgramCache]: Analyzing trace with hash -248921627, now seen corresponding path program 2 times [2022-12-13 15:04:44,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:44,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022165473] [2022-12-13 15:04:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:44,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022165473] [2022-12-13 15:04:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022165473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:44,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:44,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:04:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659122891] [2022-12-13 15:04:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:44,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:04:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:04:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:04:44,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-12-13 15:04:44,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 469 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:44,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:44,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-12-13 15:04:44,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:45,195 INFO L130 PetriNetUnfolder]: 4358/7156 cut-off events. [2022-12-13 15:04:45,195 INFO L131 PetriNetUnfolder]: For 16366/16600 co-relation queries the response was YES. [2022-12-13 15:04:45,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26781 conditions, 7156 events. 4358/7156 cut-off events. For 16366/16600 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 48310 event pairs, 884 based on Foata normal form. 171/7148 useless extension candidates. Maximal degree in co-relation 26745. Up to 2766 conditions per place. [2022-12-13 15:04:45,220 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 82 selfloop transitions, 18 changer transitions 29/141 dead transitions. [2022-12-13 15:04:45,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 141 transitions, 1221 flow [2022-12-13 15:04:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:04:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 15:04:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2022-12-13 15:04:45,222 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49562256809338523 [2022-12-13 15:04:45,222 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2022-12-13 15:04:45,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2022-12-13 15:04:45,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:45,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2022-12-13 15:04:45,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:45,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:45,226 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:45,226 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 469 flow. Second operand 8 states and 1019 transitions. [2022-12-13 15:04:45,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 141 transitions, 1221 flow [2022-12-13 15:04:45,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 141 transitions, 1092 flow, removed 33 selfloop flow, removed 10 redundant places. [2022-12-13 15:04:45,479 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 401 flow [2022-12-13 15:04:45,479 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=401, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2022-12-13 15:04:45,479 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2022-12-13 15:04:45,479 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 401 flow [2022-12-13 15:04:45,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:45,480 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:45,480 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-12-13 15:04:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:04:45,480 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-12-13 15:04:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1419233605, now seen corresponding path program 1 times [2022-12-13 15:04:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:45,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683548363] [2022-12-13 15:04:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:45,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683548363] [2022-12-13 15:04:45,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683548363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:45,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:45,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:04:45,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576521819] [2022-12-13 15:04:45,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:45,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:04:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:04:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:04:45,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-12-13 15:04:45,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 401 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:45,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:45,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-12-13 15:04:45,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:46,288 INFO L130 PetriNetUnfolder]: 2920/4788 cut-off events. [2022-12-13 15:04:46,288 INFO L131 PetriNetUnfolder]: For 11379/11465 co-relation queries the response was YES. [2022-12-13 15:04:46,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19342 conditions, 4788 events. 2920/4788 cut-off events. For 11379/11465 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 29167 event pairs, 834 based on Foata normal form. 74/4745 useless extension candidates. Maximal degree in co-relation 19312. Up to 1835 conditions per place. [2022-12-13 15:04:46,305 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 63 selfloop transitions, 1 changer transitions 42/113 dead transitions. [2022-12-13 15:04:46,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 1025 flow [2022-12-13 15:04:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:04:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:04:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2022-12-13 15:04:46,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.519455252918288 [2022-12-13 15:04:46,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2022-12-13 15:04:46,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2022-12-13 15:04:46,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:46,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2022-12-13 15:04:46,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:46,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:46,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:46,310 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 401 flow. Second operand 4 states and 534 transitions. [2022-12-13 15:04:46,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 1025 flow [2022-12-13 15:04:46,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 839 flow, removed 40 selfloop flow, removed 11 redundant places. [2022-12-13 15:04:46,379 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 308 flow [2022-12-13 15:04:46,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2022-12-13 15:04:46,380 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2022-12-13 15:04:46,380 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 308 flow [2022-12-13 15:04:46,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:46,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:46,380 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-12-13 15:04:46,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:04:46,380 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-12-13 15:04:46,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:46,381 INFO L85 PathProgramCache]: Analyzing trace with hash -197518425, now seen corresponding path program 2 times [2022-12-13 15:04:46,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:46,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435560912] [2022-12-13 15:04:46,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:46,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:46,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435560912] [2022-12-13 15:04:46,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435560912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:46,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:46,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:04:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983740237] [2022-12-13 15:04:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:46,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:04:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:04:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:04:46,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-12-13 15:04:46,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 308 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:46,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:04:46,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-12-13 15:04:46,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:04:47,111 INFO L130 PetriNetUnfolder]: 2431/3959 cut-off events. [2022-12-13 15:04:47,111 INFO L131 PetriNetUnfolder]: For 6406/6587 co-relation queries the response was YES. [2022-12-13 15:04:47,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13708 conditions, 3959 events. 2431/3959 cut-off events. For 6406/6587 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22563 event pairs, 542 based on Foata normal form. 33/3917 useless extension candidates. Maximal degree in co-relation 13689. Up to 1998 conditions per place. [2022-12-13 15:04:47,120 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 42 selfloop transitions, 1 changer transitions 61/108 dead transitions. [2022-12-13 15:04:47,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 784 flow [2022-12-13 15:04:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:04:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:04:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-12-13 15:04:47,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5233463035019456 [2022-12-13 15:04:47,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2022-12-13 15:04:47,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2022-12-13 15:04:47,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:47,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2022-12-13 15:04:47,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:47,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:47,123 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:47,123 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 308 flow. Second operand 4 states and 538 transitions. [2022-12-13 15:04:47,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 784 flow [2022-12-13 15:04:47,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 779 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 15:04:47,164 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 219 flow [2022-12-13 15:04:47,164 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2022-12-13 15:04:47,165 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2022-12-13 15:04:47,165 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 219 flow [2022-12-13 15:04:47,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:47,165 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:04:47,165 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:47,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:04:47,165 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-12-13 15:04:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1612058737, now seen corresponding path program 3 times [2022-12-13 15:04:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:47,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264244889] [2022-12-13 15:04:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:47,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:47,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:47,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:04:47,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 15:04:47,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 15:04:47,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 15:04:47,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 15:04:47,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 15:04:47,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 15:04:47,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 15:04:47,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:04:47,260 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:47,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:04:47,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:04:47,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:04:47 BasicIcfg [2022-12-13 15:04:47,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:04:47,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:04:47,313 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:04:47,313 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:04:47,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:04:13" (3/4) ... [2022-12-13 15:04:47,315 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 15:04:47,369 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 15:04:47,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:04:47,369 INFO L158 Benchmark]: Toolchain (without parser) took 34943.72ms. Allocated memory was 127.9MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 88.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 15:04:47,370 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:04:47,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.34ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 60.4MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 15:04:47,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.85ms. Allocated memory is still 127.9MB. Free memory was 60.0MB in the beginning and 57.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:04:47,370 INFO L158 Benchmark]: Boogie Preprocessor took 22.44ms. Allocated memory is still 127.9MB. Free memory was 57.6MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:04:47,370 INFO L158 Benchmark]: RCFGBuilder took 551.50ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 55.5MB in the beginning and 95.7MB in the end (delta: -40.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2022-12-13 15:04:47,371 INFO L158 Benchmark]: TraceAbstraction took 33915.37ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 95.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 15:04:47,371 INFO L158 Benchmark]: Witness Printer took 55.84ms. Allocated memory is still 3.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 15:04:47,372 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.16ms. Allocated memory is still 127.9MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.34ms. Allocated memory is still 127.9MB. Free memory was 88.6MB in the beginning and 60.4MB in the end (delta: 28.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.85ms. Allocated memory is still 127.9MB. Free memory was 60.0MB in the beginning and 57.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.44ms. Allocated memory is still 127.9MB. Free memory was 57.6MB in the beginning and 55.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.50ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 55.5MB in the beginning and 95.7MB in the end (delta: -40.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 33915.37ms. Allocated memory was 155.2MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 95.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 55.84ms. Allocated memory is still 3.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 147 PlacesBefore, 44 PlacesAfterwards, 136 TransitionsBefore, 32 TransitionsAfterwards, 3548 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 9758 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3873, independent: 3615, independent conditional: 0, independent unconditional: 3615, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1862, independent: 1812, independent conditional: 0, independent unconditional: 1812, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3873, independent: 1803, independent conditional: 0, independent unconditional: 1803, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1862, unknown conditional: 0, unknown unconditional: 1862] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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(&t353, ((void *)0), P0, ((void *)0))=-3, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t354, ((void *)0), P1, ((void *)0))=-2, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t355; [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t355, ((void *)0), P2, ((void *)0))=-1, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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, pthread_create(&t356, ((void *)0), P3, ((void *)0))=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L793] 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) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 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 [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_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=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 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) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] [L813] 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) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 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 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L770] 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) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 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 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L849] 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) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 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 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 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 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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, t353={5:0}, t354={6:0}, t355={7:0}, t356={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 878]: 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, 178 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: 33.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 815 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1686 IncrementalHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 69 mSDtfsCounter, 1686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=615occurred in iteration=8, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-12-13 15:04:47,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aed290b-415c-4232-bbd5-f9d835821db1/bin/uautomizer-uyxdKDjOR8/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