./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --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_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/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_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/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_7741fd8a-85fe-4b0b-8060-4bff3d303206/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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- 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 16:50:26,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:50:26,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:50:26,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:50:26,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:50:26,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:50:26,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:50:26,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:50:26,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:50:26,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:50:26,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:50:26,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:50:26,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:50:26,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:50:26,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:50:26,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:50:26,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:50:26,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:50:26,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:50:26,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:50:26,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:50:26,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:50:26,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:50:26,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:50:26,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:50:26,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:50:26,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:50:26,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:50:26,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:50:26,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:50:26,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:50:26,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:50:26,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:50:26,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:50:26,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:50:26,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:50:26,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:50:26,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:50:26,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:50:26,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:50:26,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:50:26,584 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:50:26,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:50:26,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:50:26,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:50:26,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:50:26,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:50:26,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:50:26,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:50:26,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:50:26,601 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:50:26,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:50:26,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:50:26,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:50:26,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:50:26,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:50:26,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:50:26,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:50:26,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:50:26,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:50:26,604 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:50:26,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:50:26,604 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:50:26,604 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_7741fd8a-85fe-4b0b-8060-4bff3d303206/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_7741fd8a-85fe-4b0b-8060-4bff3d303206/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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2022-12-13 16:50:26,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:50:26,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:50:26,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:50:26,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:50:26,786 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:50:26,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-12-13 16:50:29,338 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:50:29,527 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:50:29,527 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-12-13 16:50:29,535 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/data/74f1fee84/bce8f38033154bd98d724bf1843281e0/FLAG5c49a364b [2022-12-13 16:50:29,903 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/data/74f1fee84/bce8f38033154bd98d724bf1843281e0 [2022-12-13 16:50:29,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:50:29,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:50:29,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:50:29,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:50:29,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:50:29,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:50:29" (1/1) ... [2022-12-13 16:50:29,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b9a6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:29, skipping insertion in model container [2022-12-13 16:50:29,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:50:29" (1/1) ... [2022-12-13 16:50:29,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:50:29,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:50:30,027 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_7741fd8a-85fe-4b0b-8060-4bff3d303206/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-12-13 16:50:30,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:50:30,072 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:50:30,080 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_7741fd8a-85fe-4b0b-8060-4bff3d303206/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-12-13 16:50:30,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:50:30,107 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:50:30,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30 WrapperNode [2022-12-13 16:50:30,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:50:30,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:50:30,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:50:30,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:50:30,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,135 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2022-12-13 16:50:30,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:50:30,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:50:30,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:50:30,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:50:30,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:50:30,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:50:30,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:50:30,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:50:30,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (1/1) ... [2022-12-13 16:50:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:50:30,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:30,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:50:30,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:50:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:50:30,219 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 16:50:30,220 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 16:50:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 16:50:30,220 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 16:50:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 16:50:30,220 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 16:50:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 16:50:30,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 16:50:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:50:30,220 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 16:50:30,221 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 16:50:30,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:50:30,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:50:30,280 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:50:30,281 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:50:30,544 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:50:30,551 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:50:30,551 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:50:30,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:50:30 BoogieIcfgContainer [2022-12-13 16:50:30,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:50:30,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:50:30,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:50:30,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:50:30,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:50:29" (1/3) ... [2022-12-13 16:50:30,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446c774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:50:30, skipping insertion in model container [2022-12-13 16:50:30,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:50:30" (2/3) ... [2022-12-13 16:50:30,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446c774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:50:30, skipping insertion in model container [2022-12-13 16:50:30,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:50:30" (3/3) ... [2022-12-13 16:50:30,560 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2022-12-13 16:50:30,574 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:50:30,575 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:50:30,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:50:30,617 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;@6a8c399, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:50:30,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:50:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 86 states have (on average 1.558139534883721) internal successors, (134), 88 states have internal predecessors, (134), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-13 16:50:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 16:50:30,626 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:30,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:30,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:30,631 INFO L85 PathProgramCache]: Analyzing trace with hash 129401130, now seen corresponding path program 1 times [2022-12-13 16:50:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:30,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060714113] [2022-12-13 16:50:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:30,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:30,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 16:50:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:30,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 16:50:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 16:50:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:30,962 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 16:50:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060714113] [2022-12-13 16:50:30,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060714113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:30,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:50:30,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:50:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602526403] [2022-12-13 16:50:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:30,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:50:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:50:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:50:30,991 INFO L87 Difference]: Start difference. First operand has 103 states, 86 states have (on average 1.558139534883721) internal successors, (134), 88 states have internal predecessors, (134), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 16:50:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:31,594 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2022-12-13 16:50:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:50:31,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-12-13 16:50:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:31,603 INFO L225 Difference]: With dead ends: 281 [2022-12-13 16:50:31,603 INFO L226 Difference]: Without dead ends: 178 [2022-12-13 16:50:31,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:50:31,608 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 211 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:31,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 304 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:50:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-12-13 16:50:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 117. [2022-12-13 16:50:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-12-13 16:50:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2022-12-13 16:50:31,661 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 42 [2022-12-13 16:50:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:31,661 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2022-12-13 16:50:31,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 16:50:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2022-12-13 16:50:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:31,665 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:31,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:31,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:50:31,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1179475252, now seen corresponding path program 1 times [2022-12-13 16:50:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:31,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033897083] [2022-12-13 16:50:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:31,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033897083] [2022-12-13 16:50:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033897083] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778189653] [2022-12-13 16:50:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:31,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:31,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:31,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:31,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:50:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:31,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:50:31,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 16:50:32,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778189653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:32,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:32,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 16:50:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86135047] [2022-12-13 16:50:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:32,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:50:32,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:50:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:32,033 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:32,051 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-12-13 16:50:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:50:32,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:32,053 INFO L225 Difference]: With dead ends: 227 [2022-12-13 16:50:32,053 INFO L226 Difference]: Without dead ends: 117 [2022-12-13 16:50:32,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:32,054 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:32,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-13 16:50:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-12-13 16:50:32,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-12-13 16:50:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2022-12-13 16:50:32,066 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 101 [2022-12-13 16:50:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:32,066 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2022-12-13 16:50:32,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2022-12-13 16:50:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:32,068 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:32,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:32,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:50:32,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:32,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -779099534, now seen corresponding path program 1 times [2022-12-13 16:50:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:32,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576892330] [2022-12-13 16:50:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:32,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:32,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576892330] [2022-12-13 16:50:32,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576892330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256430432] [2022-12-13 16:50:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:32,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:32,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:50:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:32,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:32,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 16:50:32,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:32,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256430432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:32,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:32,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123974232] [2022-12-13 16:50:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:32,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:32,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:32,721 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:32,893 INFO L93 Difference]: Finished difference Result 356 states and 529 transitions. [2022-12-13 16:50:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:32,896 INFO L225 Difference]: With dead ends: 356 [2022-12-13 16:50:32,896 INFO L226 Difference]: Without dead ends: 248 [2022-12-13 16:50:32,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:32,898 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 240 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:32,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 407 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-12-13 16:50:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2022-12-13 16:50:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 200 states have (on average 1.485) internal successors, (297), 203 states have internal predecessors, (297), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2022-12-13 16:50:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2022-12-13 16:50:32,933 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 101 [2022-12-13 16:50:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:32,933 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2022-12-13 16:50:32,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2022-12-13 16:50:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:32,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:32,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:32,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:50:33,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:33,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -213976846, now seen corresponding path program 1 times [2022-12-13 16:50:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:33,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968984579] [2022-12-13 16:50:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:33,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968984579] [2022-12-13 16:50:33,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968984579] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:33,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148575486] [2022-12-13 16:50:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:33,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:33,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:33,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:50:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:33,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 16:50:33,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:33,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148575486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:33,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:33,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006101681] [2022-12-13 16:50:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:33,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:33,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:33,416 INFO L87 Difference]: Start difference. First operand 233 states and 343 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:33,573 INFO L93 Difference]: Finished difference Result 705 states and 1058 transitions. [2022-12-13 16:50:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:33,577 INFO L225 Difference]: With dead ends: 705 [2022-12-13 16:50:33,577 INFO L226 Difference]: Without dead ends: 485 [2022-12-13 16:50:33,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:33,579 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 237 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:33,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 393 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-12-13 16:50:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-12-13 16:50:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 402 states have (on average 1.472636815920398) internal successors, (592), 411 states have internal predecessors, (592), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2022-12-13 16:50:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 700 transitions. [2022-12-13 16:50:33,614 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 700 transitions. Word has length 101 [2022-12-13 16:50:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:33,614 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 700 transitions. [2022-12-13 16:50:33,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 700 transitions. [2022-12-13 16:50:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:33,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:33,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:33,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:50:33,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:33,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2077246898, now seen corresponding path program 1 times [2022-12-13 16:50:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:33,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119419080] [2022-12-13 16:50:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:33,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119419080] [2022-12-13 16:50:34,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119419080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:34,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979972876] [2022-12-13 16:50:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:34,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:34,041 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:34,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:50:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:34,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 16:50:34,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:34,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979972876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:34,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:34,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550106334] [2022-12-13 16:50:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:34,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:34,177 INFO L87 Difference]: Start difference. First operand 469 states and 700 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:34,368 INFO L93 Difference]: Finished difference Result 1557 states and 2395 transitions. [2022-12-13 16:50:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:34,372 INFO L225 Difference]: With dead ends: 1557 [2022-12-13 16:50:34,373 INFO L226 Difference]: Without dead ends: 1109 [2022-12-13 16:50:34,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:34,375 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 250 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:34,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 435 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-12-13 16:50:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2022-12-13 16:50:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 880 states have (on average 1.45) internal successors, (1276), 907 states have internal predecessors, (1276), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2022-12-13 16:50:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1550 transitions. [2022-12-13 16:50:34,437 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1550 transitions. Word has length 101 [2022-12-13 16:50:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:34,437 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1550 transitions. [2022-12-13 16:50:34,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1550 transitions. [2022-12-13 16:50:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:34,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:34,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:34,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:50:34,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:34,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -300696526, now seen corresponding path program 1 times [2022-12-13 16:50:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:34,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63100650] [2022-12-13 16:50:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:34,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63100650] [2022-12-13 16:50:34,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63100650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:34,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356868598] [2022-12-13 16:50:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:34,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:34,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:34,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:34,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:50:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:34,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:34,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 16:50:35,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:35,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356868598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:35,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:35,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151161610] [2022-12-13 16:50:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:35,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:35,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:35,013 INFO L87 Difference]: Start difference. First operand 1021 states and 1550 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:35,259 INFO L93 Difference]: Finished difference Result 3377 states and 5343 transitions. [2022-12-13 16:50:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:35,271 INFO L225 Difference]: With dead ends: 3377 [2022-12-13 16:50:35,271 INFO L226 Difference]: Without dead ends: 2393 [2022-12-13 16:50:35,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:35,275 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 245 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:35,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 421 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-12-13 16:50:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2261. [2022-12-13 16:50:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1954 states have (on average 1.4237461617195497) internal successors, (2782), 2035 states have internal predecessors, (2782), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2022-12-13 16:50:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3538 transitions. [2022-12-13 16:50:35,415 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3538 transitions. Word has length 101 [2022-12-13 16:50:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:35,415 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3538 transitions. [2022-12-13 16:50:35,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3538 transitions. [2022-12-13 16:50:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:35,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:35,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:50:35,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:50:35,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:35,623 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:35,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash 38237618, now seen corresponding path program 1 times [2022-12-13 16:50:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:35,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535700181] [2022-12-13 16:50:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535700181] [2022-12-13 16:50:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535700181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037397183] [2022-12-13 16:50:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:35,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:35,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:35,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:35,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:50:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:35,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:50:35,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:50:35,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:35,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037397183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:35,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:35,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-12-13 16:50:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276877520] [2022-12-13 16:50:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:35,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:50:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:50:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:50:35,855 INFO L87 Difference]: Start difference. First operand 2261 states and 3538 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:36,060 INFO L93 Difference]: Finished difference Result 4789 states and 7470 transitions. [2022-12-13 16:50:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:50:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:36,074 INFO L225 Difference]: With dead ends: 4789 [2022-12-13 16:50:36,074 INFO L226 Difference]: Without dead ends: 2629 [2022-12-13 16:50:36,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:50:36,082 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 30 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:36,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 704 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-12-13 16:50:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2341. [2022-12-13 16:50:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 2018 states have (on average 1.4103072348860257) internal successors, (2846), 2099 states have internal predecessors, (2846), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2022-12-13 16:50:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3634 transitions. [2022-12-13 16:50:36,252 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3634 transitions. Word has length 101 [2022-12-13 16:50:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:36,252 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3634 transitions. [2022-12-13 16:50:36,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3634 transitions. [2022-12-13 16:50:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:36,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:36,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:36,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 16:50:36,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:36,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:36,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1425023028, now seen corresponding path program 1 times [2022-12-13 16:50:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:36,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477906995] [2022-12-13 16:50:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:36,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:36,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477906995] [2022-12-13 16:50:36,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477906995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:36,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169764456] [2022-12-13 16:50:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:36,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:36,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:36,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:36,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 16:50:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:36,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:50:36,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:50:36,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:36,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169764456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:36,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:36,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 16:50:36,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957098704] [2022-12-13 16:50:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:36,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:50:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:36,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:50:36,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:36,681 INFO L87 Difference]: Start difference. First operand 2341 states and 3634 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:36,833 INFO L93 Difference]: Finished difference Result 5110 states and 7919 transitions. [2022-12-13 16:50:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:50:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-12-13 16:50:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:36,844 INFO L225 Difference]: With dead ends: 5110 [2022-12-13 16:50:36,844 INFO L226 Difference]: Without dead ends: 2870 [2022-12-13 16:50:36,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:36,850 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 66 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:36,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 273 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2022-12-13 16:50:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2578. [2022-12-13 16:50:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2159 states have (on average 1.3756368689207967) internal successors, (2970), 2240 states have internal predecessors, (2970), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2022-12-13 16:50:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3967 transitions. [2022-12-13 16:50:37,017 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3967 transitions. Word has length 101 [2022-12-13 16:50:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:37,017 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3967 transitions. [2022-12-13 16:50:37,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3967 transitions. [2022-12-13 16:50:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 16:50:37,027 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:37,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:37,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 16:50:37,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 16:50:37,228 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 457672374, now seen corresponding path program 1 times [2022-12-13 16:50:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:37,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431564791] [2022-12-13 16:50:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 16:50:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 16:50:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:50:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:50:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:37,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:37,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431564791] [2022-12-13 16:50:37,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431564791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:37,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698512061] [2022-12-13 16:50:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:37,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:37,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:37,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:37,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 16:50:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:37,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 16:50:37,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 16:50:37,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:37,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698512061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:37,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:37,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493805692] [2022-12-13 16:50:37,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:37,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:37,454 INFO L87 Difference]: Start difference. First operand 2578 states and 3967 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:37,644 INFO L93 Difference]: Finished difference Result 5010 states and 7692 transitions. [2022-12-13 16:50:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:50:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-13 16:50:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:37,654 INFO L225 Difference]: With dead ends: 5010 [2022-12-13 16:50:37,654 INFO L226 Difference]: Without dead ends: 2658 [2022-12-13 16:50:37,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:37,660 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 9 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:37,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 554 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-12-13 16:50:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2626. [2022-12-13 16:50:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2207 states have (on average 1.3674671499773448) internal successors, (3018), 2288 states have internal predecessors, (3018), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2022-12-13 16:50:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4015 transitions. [2022-12-13 16:50:37,817 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4015 transitions. Word has length 101 [2022-12-13 16:50:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:37,817 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 4015 transitions. [2022-12-13 16:50:37,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4015 transitions. [2022-12-13 16:50:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 16:50:37,825 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:37,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:37,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 16:50:38,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:38,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2122057235, now seen corresponding path program 1 times [2022-12-13 16:50:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:38,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311977141] [2022-12-13 16:50:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:50:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:50:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:50:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:50:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:50:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311977141] [2022-12-13 16:50:38,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311977141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634196180] [2022-12-13 16:50:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:38,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:38,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 16:50:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:50:38,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 16:50:38,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634196180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 16:50:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381307585] [2022-12-13 16:50:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:38,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:50:38,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:50:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:38,230 INFO L87 Difference]: Start difference. First operand 2626 states and 4015 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:38,398 INFO L93 Difference]: Finished difference Result 5324 states and 8539 transitions. [2022-12-13 16:50:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:50:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-12-13 16:50:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:38,409 INFO L225 Difference]: With dead ends: 5324 [2022-12-13 16:50:38,409 INFO L226 Difference]: Without dead ends: 2908 [2022-12-13 16:50:38,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:38,415 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:38,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-12-13 16:50:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-12-13 16:50:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2393 states have (on average 1.3522774759715839) internal successors, (3236), 2474 states have internal predecessors, (3236), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2022-12-13 16:50:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4555 transitions. [2022-12-13 16:50:38,588 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4555 transitions. Word has length 104 [2022-12-13 16:50:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:38,588 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 4555 transitions. [2022-12-13 16:50:38,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4555 transitions. [2022-12-13 16:50:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 16:50:38,596 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:38,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:38,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 16:50:38,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 16:50:38,797 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:38,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 163482449, now seen corresponding path program 1 times [2022-12-13 16:50:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:38,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194338583] [2022-12-13 16:50:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:50:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:50:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:50:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:50:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:50:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:38,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194338583] [2022-12-13 16:50:38,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194338583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:38,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076498732] [2022-12-13 16:50:38,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:38,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:38,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:38,889 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:38,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 16:50:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:38,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:38,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:50:39,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:39,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076498732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:39,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:39,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:39,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932471017] [2022-12-13 16:50:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:39,010 INFO L87 Difference]: Start difference. First operand 2908 states and 4555 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:39,499 INFO L93 Difference]: Finished difference Result 9208 states and 15036 transitions. [2022-12-13 16:50:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:50:39,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-12-13 16:50:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:39,524 INFO L225 Difference]: With dead ends: 9208 [2022-12-13 16:50:39,525 INFO L226 Difference]: Without dead ends: 6558 [2022-12-13 16:50:39,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:39,540 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 210 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:39,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 743 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2022-12-13 16:50:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6458. [2022-12-13 16:50:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 5429 states have (on average 1.3494197826487382) internal successors, (7326), 5688 states have internal predecessors, (7326), 481 states have call successors, (481), 257 states have call predecessors, (481), 547 states have return successors, (2540), 576 states have call predecessors, (2540), 481 states have call successors, (2540) [2022-12-13 16:50:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10347 transitions. [2022-12-13 16:50:39,940 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10347 transitions. Word has length 104 [2022-12-13 16:50:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:39,940 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10347 transitions. [2022-12-13 16:50:39,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10347 transitions. [2022-12-13 16:50:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 16:50:39,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:39,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:39,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 16:50:40,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 16:50:40,161 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1052671277, now seen corresponding path program 1 times [2022-12-13 16:50:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:40,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442081885] [2022-12-13 16:50:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:50:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 16:50:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:50:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:50:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:50:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:50:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:50:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:40,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:40,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442081885] [2022-12-13 16:50:40,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442081885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325975334] [2022-12-13 16:50:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:40,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:40,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:40,247 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:40,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 16:50:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:40,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:50:40,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 16:50:40,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:40,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325975334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:40,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:40,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-12-13 16:50:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481513338] [2022-12-13 16:50:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:40,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:40,354 INFO L87 Difference]: Start difference. First operand 6458 states and 10347 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:40,862 INFO L93 Difference]: Finished difference Result 14114 states and 22261 transitions. [2022-12-13 16:50:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2022-12-13 16:50:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:40,888 INFO L225 Difference]: With dead ends: 14114 [2022-12-13 16:50:40,888 INFO L226 Difference]: Without dead ends: 7922 [2022-12-13 16:50:40,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:50:40,902 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 72 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:40,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-12-13 16:50:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6458. [2022-12-13 16:50:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 5429 states have (on average 1.3490513906796833) internal successors, (7324), 5688 states have internal predecessors, (7324), 481 states have call successors, (481), 257 states have call predecessors, (481), 547 states have return successors, (2540), 576 states have call predecessors, (2540), 481 states have call successors, (2540) [2022-12-13 16:50:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10345 transitions. [2022-12-13 16:50:41,406 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10345 transitions. Word has length 104 [2022-12-13 16:50:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:41,406 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10345 transitions. [2022-12-13 16:50:41,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10345 transitions. [2022-12-13 16:50:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 16:50:41,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:41,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:41,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 16:50:41,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 16:50:41,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -611500932, now seen corresponding path program 1 times [2022-12-13 16:50:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:41,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310670892] [2022-12-13 16:50:41,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:50:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:50:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:50:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:50:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:50:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:50:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:50:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:50:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310670892] [2022-12-13 16:50:41,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310670892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530938946] [2022-12-13 16:50:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:41,842 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:41,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 16:50:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:41,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:50:41,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 16:50:41,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:41,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530938946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:41,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:41,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 16:50:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45431809] [2022-12-13 16:50:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:41,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:50:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:41,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:50:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:41,929 INFO L87 Difference]: Start difference. First operand 6458 states and 10345 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:42,392 INFO L93 Difference]: Finished difference Result 12874 states and 20913 transitions. [2022-12-13 16:50:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:50:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2022-12-13 16:50:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:42,419 INFO L225 Difference]: With dead ends: 12874 [2022-12-13 16:50:42,419 INFO L226 Difference]: Without dead ends: 6894 [2022-12-13 16:50:42,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:42,437 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:42,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2022-12-13 16:50:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6894. [2022-12-13 16:50:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6894 states, 5721 states have (on average 1.340325117986366) internal successors, (7668), 5980 states have internal predecessors, (7668), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2022-12-13 16:50:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11161 transitions. [2022-12-13 16:50:42,858 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11161 transitions. Word has length 107 [2022-12-13 16:50:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:42,858 INFO L495 AbstractCegarLoop]: Abstraction has 6894 states and 11161 transitions. [2022-12-13 16:50:42,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11161 transitions. [2022-12-13 16:50:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 16:50:42,872 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:42,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:42,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 16:50:43,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 16:50:43,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1264981886, now seen corresponding path program 1 times [2022-12-13 16:50:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:43,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457205009] [2022-12-13 16:50:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:50:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:50:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:50:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:50:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:50:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:50:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:50:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:50:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457205009] [2022-12-13 16:50:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457205009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796499252] [2022-12-13 16:50:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:43,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:43,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 16:50:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:43,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:43,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:50:43,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:43,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796499252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:43,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:43,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004890929] [2022-12-13 16:50:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:43,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:43,314 INFO L87 Difference]: Start difference. First operand 6894 states and 11161 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:43,793 INFO L93 Difference]: Finished difference Result 13370 states and 21103 transitions. [2022-12-13 16:50:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:50:43,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2022-12-13 16:50:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:43,811 INFO L225 Difference]: With dead ends: 13370 [2022-12-13 16:50:43,812 INFO L226 Difference]: Without dead ends: 7018 [2022-12-13 16:50:43,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:43,824 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 198 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:43,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 707 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2022-12-13 16:50:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 7014. [2022-12-13 16:50:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 5817 states have (on average 1.3312704143029053) internal successors, (7744), 6100 states have internal predecessors, (7744), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-12-13 16:50:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 10881 transitions. [2022-12-13 16:50:44,289 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 10881 transitions. Word has length 107 [2022-12-13 16:50:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:44,290 INFO L495 AbstractCegarLoop]: Abstraction has 7014 states and 10881 transitions. [2022-12-13 16:50:44,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 10881 transitions. [2022-12-13 16:50:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 16:50:44,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:44,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:44,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 16:50:44,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:44,510 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -549218888, now seen corresponding path program 2 times [2022-12-13 16:50:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587969321] [2022-12-13 16:50:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:50:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:50:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:50:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:50:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:50:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:50:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:50:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:50:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:44,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587969321] [2022-12-13 16:50:44,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587969321] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:44,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755335298] [2022-12-13 16:50:44,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:50:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:44,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:44,605 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:44,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 16:50:44,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:50:44,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:50:44,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:50:44,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 16:50:44,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:44,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755335298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:44,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:44,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:44,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230228948] [2022-12-13 16:50:44,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:44,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:44,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:44,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:44,693 INFO L87 Difference]: Start difference. First operand 7014 states and 10881 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 16:50:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:45,322 INFO L93 Difference]: Finished difference Result 10122 states and 18596 transitions. [2022-12-13 16:50:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:50:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 107 [2022-12-13 16:50:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:45,356 INFO L225 Difference]: With dead ends: 10122 [2022-12-13 16:50:45,356 INFO L226 Difference]: Without dead ends: 10118 [2022-12-13 16:50:45,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:50:45,363 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 117 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:45,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 759 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2022-12-13 16:50:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 7206. [2022-12-13 16:50:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7206 states, 6009 states have (on average 1.3206856382093526) internal successors, (7936), 6292 states have internal predecessors, (7936), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-12-13 16:50:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 11073 transitions. [2022-12-13 16:50:45,872 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 11073 transitions. Word has length 107 [2022-12-13 16:50:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:45,873 INFO L495 AbstractCegarLoop]: Abstraction has 7206 states and 11073 transitions. [2022-12-13 16:50:45,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 16:50:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 11073 transitions. [2022-12-13 16:50:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 16:50:45,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:45,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:45,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 16:50:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:46,090 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1225788474, now seen corresponding path program 1 times [2022-12-13 16:50:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:46,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663117023] [2022-12-13 16:50:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:50:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:50:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:50:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:50:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:50:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:50:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:50:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:50:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 16:50:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:46,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663117023] [2022-12-13 16:50:46,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663117023] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:46,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055262892] [2022-12-13 16:50:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:46,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:46,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:46,180 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:46,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 16:50:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:46,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:50:46,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 16:50:46,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:46,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055262892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:46,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:46,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-12-13 16:50:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846587403] [2022-12-13 16:50:46,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:46,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:50:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:46,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:50:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:50:46,299 INFO L87 Difference]: Start difference. First operand 7206 states and 11073 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 16:50:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:46,691 INFO L93 Difference]: Finished difference Result 14926 states and 24105 transitions. [2022-12-13 16:50:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:46,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 107 [2022-12-13 16:50:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:46,718 INFO L225 Difference]: With dead ends: 14926 [2022-12-13 16:50:46,718 INFO L226 Difference]: Without dead ends: 8278 [2022-12-13 16:50:46,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:46,731 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 40 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:46,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 875 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2022-12-13 16:50:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7110. [2022-12-13 16:50:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5913 states have (on average 1.3150684931506849) internal successors, (7776), 6196 states have internal predecessors, (7776), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-12-13 16:50:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10913 transitions. [2022-12-13 16:50:47,270 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10913 transitions. Word has length 107 [2022-12-13 16:50:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:47,270 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10913 transitions. [2022-12-13 16:50:47,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-12-13 16:50:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10913 transitions. [2022-12-13 16:50:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-12-13 16:50:47,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:47,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:47,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 16:50:47,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 16:50:47,487 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1916204999, now seen corresponding path program 1 times [2022-12-13 16:50:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:47,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100443394] [2022-12-13 16:50:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 16:50:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:50:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:50:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:50:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:50:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:50:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:50:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 16:50:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:50:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 16:50:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100443394] [2022-12-13 16:50:47,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100443394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237829116] [2022-12-13 16:50:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:47,609 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:47,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 16:50:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:47,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:50:47,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 16:50:47,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:47,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237829116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:47,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:47,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-12-13 16:50:47,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648785970] [2022-12-13 16:50:47,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:47,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:47,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:47,718 INFO L87 Difference]: Start difference. First operand 7110 states and 10913 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:48,361 INFO L93 Difference]: Finished difference Result 15142 states and 23023 transitions. [2022-12-13 16:50:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:48,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2022-12-13 16:50:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:48,385 INFO L225 Difference]: With dead ends: 15142 [2022-12-13 16:50:48,385 INFO L226 Difference]: Without dead ends: 8334 [2022-12-13 16:50:48,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:50:48,398 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 75 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:48,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 352 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2022-12-13 16:50:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7110. [2022-12-13 16:50:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5913 states have (on average 1.3143920175883645) internal successors, (7772), 6196 states have internal predecessors, (7772), 577 states have call successors, (577), 305 states have call predecessors, (577), 619 states have return successors, (2560), 672 states have call predecessors, (2560), 577 states have call successors, (2560) [2022-12-13 16:50:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10909 transitions. [2022-12-13 16:50:48,977 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10909 transitions. Word has length 110 [2022-12-13 16:50:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:48,977 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10909 transitions. [2022-12-13 16:50:48,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10909 transitions. [2022-12-13 16:50:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 16:50:48,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:48,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:48,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 16:50:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 16:50:49,192 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash -406385611, now seen corresponding path program 1 times [2022-12-13 16:50:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:49,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085255733] [2022-12-13 16:50:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:50:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 16:50:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:50:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:50:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:50:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:50:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:50:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 16:50:49,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:49,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085255733] [2022-12-13 16:50:49,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085255733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:49,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686617514] [2022-12-13 16:50:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:49,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:49,312 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:49,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 16:50:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:49,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:50:49,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 16:50:49,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686617514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:49,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:49,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-12-13 16:50:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263248817] [2022-12-13 16:50:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:49,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:50:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:50:49,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:49,386 INFO L87 Difference]: Start difference. First operand 7110 states and 10909 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:49,783 INFO L93 Difference]: Finished difference Result 14358 states and 22185 transitions. [2022-12-13 16:50:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:50:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 113 [2022-12-13 16:50:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:49,800 INFO L225 Difference]: With dead ends: 14358 [2022-12-13 16:50:49,800 INFO L226 Difference]: Without dead ends: 7774 [2022-12-13 16:50:49,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:49,812 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 21 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:49,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2022-12-13 16:50:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7774. [2022-12-13 16:50:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7774 states, 6361 states have (on average 1.301682125451973) internal successors, (8280), 6644 states have internal predecessors, (8280), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3000), 816 states have call predecessors, (3000), 721 states have call successors, (3000) [2022-12-13 16:50:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12001 transitions. [2022-12-13 16:50:50,289 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12001 transitions. Word has length 113 [2022-12-13 16:50:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:50,289 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 12001 transitions. [2022-12-13 16:50:50,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12001 transitions. [2022-12-13 16:50:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 16:50:50,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:50,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:50,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 16:50:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 16:50:50,505 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -992661833, now seen corresponding path program 1 times [2022-12-13 16:50:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:50,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118218775] [2022-12-13 16:50:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:50:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 16:50:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:50:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:50:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:50:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:50:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:50:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 16:50:50,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:50,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118218775] [2022-12-13 16:50:50,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118218775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:50,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151960105] [2022-12-13 16:50:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:50,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:50,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:50,606 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:50,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 16:50:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:50,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:50,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:50:50,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:50,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151960105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:50,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:50,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599977617] [2022-12-13 16:50:50,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:50,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:50,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:50,721 INFO L87 Difference]: Start difference. First operand 7774 states and 12001 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:51,368 INFO L93 Difference]: Finished difference Result 15082 states and 22658 transitions. [2022-12-13 16:50:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:50:51,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 113 [2022-12-13 16:50:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:51,386 INFO L225 Difference]: With dead ends: 15082 [2022-12-13 16:50:51,386 INFO L226 Difference]: Without dead ends: 7922 [2022-12-13 16:50:51,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:50:51,398 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 194 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:51,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 662 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-12-13 16:50:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7918. [2022-12-13 16:50:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7918 states, 6469 states have (on average 1.2916988715411966) internal successors, (8356), 6788 states have internal predecessors, (8356), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2680), 816 states have call predecessors, (2680), 721 states have call successors, (2680) [2022-12-13 16:50:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11757 transitions. [2022-12-13 16:50:51,892 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11757 transitions. Word has length 113 [2022-12-13 16:50:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:51,892 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11757 transitions. [2022-12-13 16:50:51,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11757 transitions. [2022-12-13 16:50:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 16:50:51,907 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:51,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:51,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 16:50:52,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:52,108 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash -38721675, now seen corresponding path program 1 times [2022-12-13 16:50:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277349039] [2022-12-13 16:50:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:50:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 16:50:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:50:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:50:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:50:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:50:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:50:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:50:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 16:50:52,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:52,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277349039] [2022-12-13 16:50:52,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277349039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:52,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101752623] [2022-12-13 16:50:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:52,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:52,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:52,210 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:52,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 16:50:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:52,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:50:52,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 16:50:52,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:52,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101752623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:52,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:52,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-12-13 16:50:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087529191] [2022-12-13 16:50:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:52,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:52,305 INFO L87 Difference]: Start difference. First operand 7918 states and 11757 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:52,891 INFO L93 Difference]: Finished difference Result 16338 states and 24119 transitions. [2022-12-13 16:50:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2022-12-13 16:50:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:52,909 INFO L225 Difference]: With dead ends: 16338 [2022-12-13 16:50:52,909 INFO L226 Difference]: Without dead ends: 8782 [2022-12-13 16:50:52,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:50:52,921 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:52,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 334 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8782 states. [2022-12-13 16:50:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7918. [2022-12-13 16:50:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7918 states, 6469 states have (on average 1.2904622043592517) internal successors, (8348), 6788 states have internal predecessors, (8348), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2680), 816 states have call predecessors, (2680), 721 states have call successors, (2680) [2022-12-13 16:50:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11749 transitions. [2022-12-13 16:50:53,502 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11749 transitions. Word has length 113 [2022-12-13 16:50:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:53,502 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11749 transitions. [2022-12-13 16:50:53,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11749 transitions. [2022-12-13 16:50:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 16:50:53,522 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:53,522 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:53,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 16:50:53,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:53,723 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1693209122, now seen corresponding path program 1 times [2022-12-13 16:50:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:53,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723563145] [2022-12-13 16:50:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:50:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:50:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:50:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:50:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 16:50:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 16:50:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 16:50:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723563145] [2022-12-13 16:50:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723563145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066570306] [2022-12-13 16:50:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:53,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:53,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:53,835 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:53,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 16:50:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:53,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:50:53,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 16:50:53,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:53,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066570306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:53,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:53,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:50:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281929012] [2022-12-13 16:50:53,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:53,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:50:53,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:53,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:50:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:50:53,939 INFO L87 Difference]: Start difference. First operand 7918 states and 11749 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:54,461 INFO L93 Difference]: Finished difference Result 16238 states and 24098 transitions. [2022-12-13 16:50:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:50:54,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-12-13 16:50:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:54,481 INFO L225 Difference]: With dead ends: 16238 [2022-12-13 16:50:54,481 INFO L226 Difference]: Without dead ends: 8918 [2022-12-13 16:50:54,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:50:54,495 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:54,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:50:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2022-12-13 16:50:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8918. [2022-12-13 16:50:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 7145 states have (on average 1.2717984604618615) internal successors, (9087), 7464 states have internal predecessors, (9087), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3216), 1032 states have call predecessors, (3216), 937 states have call successors, (3216) [2022-12-13 16:50:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13240 transitions. [2022-12-13 16:50:55,079 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13240 transitions. Word has length 116 [2022-12-13 16:50:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:55,079 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 13240 transitions. [2022-12-13 16:50:55,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13240 transitions. [2022-12-13 16:50:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 16:50:55,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:55,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:55,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 16:50:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:55,297 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash -265365664, now seen corresponding path program 1 times [2022-12-13 16:50:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222798511] [2022-12-13 16:50:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:50:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:50:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:50:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:50:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 16:50:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 16:50:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 16:50:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:55,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222798511] [2022-12-13 16:50:55,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222798511] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:55,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621271886] [2022-12-13 16:50:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:55,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:55,377 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:55,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 16:50:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:55,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:50:55,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:50:55,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:55,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621271886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:55,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:55,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-12-13 16:50:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774681911] [2022-12-13 16:50:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:55,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:55,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:50:55,484 INFO L87 Difference]: Start difference. First operand 8918 states and 13240 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:56,246 INFO L93 Difference]: Finished difference Result 17280 states and 24901 transitions. [2022-12-13 16:50:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:50:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-12-13 16:50:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:56,263 INFO L225 Difference]: With dead ends: 17280 [2022-12-13 16:50:56,263 INFO L226 Difference]: Without dead ends: 9084 [2022-12-13 16:50:56,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:50:56,276 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 190 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:56,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 632 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-12-13 16:50:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9080. [2022-12-13 16:50:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9080 states, 7253 states have (on average 1.2596167103267613) internal successors, (9136), 7626 states have internal predecessors, (9136), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2920), 1032 states have call predecessors, (2920), 937 states have call successors, (2920) [2022-12-13 16:50:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 12993 transitions. [2022-12-13 16:50:56,852 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 12993 transitions. Word has length 116 [2022-12-13 16:50:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:56,853 INFO L495 AbstractCegarLoop]: Abstraction has 9080 states and 12993 transitions. [2022-12-13 16:50:56,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 12993 transitions. [2022-12-13 16:50:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 16:50:56,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:56,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:56,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 16:50:57,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:57,071 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1481519390, now seen corresponding path program 1 times [2022-12-13 16:50:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062013595] [2022-12-13 16:50:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:50:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:50:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:50:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:50:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 16:50:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 16:50:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 16:50:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:57,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062013595] [2022-12-13 16:50:57,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062013595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:57,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161686110] [2022-12-13 16:50:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:57,180 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:57,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 16:50:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:57,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:50:57,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 16:50:57,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:57,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161686110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:57,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:57,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-12-13 16:50:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059992681] [2022-12-13 16:50:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:57,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:50:57,304 INFO L87 Difference]: Start difference. First operand 9080 states and 12993 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:57,843 INFO L93 Difference]: Finished difference Result 14370 states and 20213 transitions. [2022-12-13 16:50:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:50:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-12-13 16:50:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:57,855 INFO L225 Difference]: With dead ends: 14370 [2022-12-13 16:50:57,855 INFO L226 Difference]: Without dead ends: 5904 [2022-12-13 16:50:57,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:50:57,867 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 90 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:57,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 446 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2022-12-13 16:50:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 5808. [2022-12-13 16:50:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5808 states, 4616 states have (on average 1.2606152512998268) internal successors, (5819), 4870 states have internal predecessors, (5819), 609 states have call successors, (609), 313 states have call predecessors, (609), 582 states have return successors, (1854), 656 states have call predecessors, (1854), 609 states have call successors, (1854) [2022-12-13 16:50:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 8282 transitions. [2022-12-13 16:50:58,249 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 8282 transitions. Word has length 116 [2022-12-13 16:50:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:58,249 INFO L495 AbstractCegarLoop]: Abstraction has 5808 states and 8282 transitions. [2022-12-13 16:50:58,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:50:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 8282 transitions. [2022-12-13 16:50:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 16:50:58,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:58,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:58,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 16:50:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 16:50:58,460 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -961227544, now seen corresponding path program 1 times [2022-12-13 16:50:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842272577] [2022-12-13 16:50:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:50:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:50:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 16:50:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:50:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:50:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:50:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 16:50:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:50:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 16:50:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 16:50:58,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:58,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842272577] [2022-12-13 16:50:58,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842272577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:58,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144884154] [2022-12-13 16:50:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:58,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:58,590 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:58,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 16:50:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:58,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:50:58,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:50:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 16:50:58,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:50:58,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144884154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:50:58,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:50:58,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-12-13 16:50:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604472470] [2022-12-13 16:50:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:50:58,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:50:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:50:58,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:50:58,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:50:58,772 INFO L87 Difference]: Start difference. First operand 5808 states and 8282 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:50:59,237 INFO L93 Difference]: Finished difference Result 11110 states and 15539 transitions. [2022-12-13 16:50:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:50:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 116 [2022-12-13 16:50:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:50:59,247 INFO L225 Difference]: With dead ends: 11110 [2022-12-13 16:50:59,248 INFO L226 Difference]: Without dead ends: 5496 [2022-12-13 16:50:59,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:50:59,256 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:50:59,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 446 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:50:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2022-12-13 16:50:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5496. [2022-12-13 16:50:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5496 states, 4460 states have (on average 1.2643497757847533) internal successors, (5639), 4698 states have internal predecessors, (5639), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:50:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 7528 transitions. [2022-12-13 16:50:59,594 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 7528 transitions. Word has length 116 [2022-12-13 16:50:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:50:59,594 INFO L495 AbstractCegarLoop]: Abstraction has 5496 states and 7528 transitions. [2022-12-13 16:50:59,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:50:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 7528 transitions. [2022-12-13 16:50:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-13 16:50:59,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:50:59,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:59,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 16:50:59,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:59,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:50:59,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:50:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 230421370, now seen corresponding path program 1 times [2022-12-13 16:50:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:50:59,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594628230] [2022-12-13 16:50:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:50:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:50:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:50:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:50:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:50:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:50:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:50:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 16:50:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:50:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:50:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 16:50:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 16:50:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:50:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:50:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:50:59,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594628230] [2022-12-13 16:50:59,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594628230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:50:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959770138] [2022-12-13 16:50:59,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:50:59,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:50:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:50:59,955 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:50:59,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 16:51:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:00,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:51:00,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:00,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:00,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959770138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:00,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:00,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-12-13 16:51:00,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382152222] [2022-12-13 16:51:00,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:00,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:51:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:51:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:51:00,041 INFO L87 Difference]: Start difference. First operand 5496 states and 7528 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:51:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:00,435 INFO L93 Difference]: Finished difference Result 11630 states and 16840 transitions. [2022-12-13 16:51:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:51:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 131 [2022-12-13 16:51:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:00,448 INFO L225 Difference]: With dead ends: 11630 [2022-12-13 16:51:00,448 INFO L226 Difference]: Without dead ends: 6436 [2022-12-13 16:51:00,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:51:00,456 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 26 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:00,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 305 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2022-12-13 16:51:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 5544. [2022-12-13 16:51:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.2615350488021295) internal successors, (5687), 4746 states have internal predecessors, (5687), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:51:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7576 transitions. [2022-12-13 16:51:00,822 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7576 transitions. Word has length 131 [2022-12-13 16:51:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:00,822 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7576 transitions. [2022-12-13 16:51:00,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:51:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7576 transitions. [2022-12-13 16:51:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 16:51:00,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:00,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:00,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 16:51:01,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 16:51:01,031 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876967, now seen corresponding path program 1 times [2022-12-13 16:51:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:01,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393982406] [2022-12-13 16:51:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 16:51:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:51:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:51:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 16:51:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:51:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 16:51:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:01,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393982406] [2022-12-13 16:51:01,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393982406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:01,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886942043] [2022-12-13 16:51:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:01,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:01,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:01,180 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:01,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 16:51:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:01,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:51:01,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:01,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:01,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886942043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:01,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:01,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-12-13 16:51:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717407727] [2022-12-13 16:51:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:01,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:51:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:01,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:51:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:51:01,272 INFO L87 Difference]: Start difference. First operand 5544 states and 7576 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:51:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:01,670 INFO L93 Difference]: Finished difference Result 11662 states and 16808 transitions. [2022-12-13 16:51:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:51:01,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 132 [2022-12-13 16:51:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:01,684 INFO L225 Difference]: With dead ends: 11662 [2022-12-13 16:51:01,684 INFO L226 Difference]: Without dead ends: 6420 [2022-12-13 16:51:01,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:51:01,693 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 30 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:01,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2022-12-13 16:51:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5544. [2022-12-13 16:51:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.2508873114463177) internal successors, (5639), 4746 states have internal predecessors, (5639), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:51:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7528 transitions. [2022-12-13 16:51:02,067 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7528 transitions. Word has length 132 [2022-12-13 16:51:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:02,067 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7528 transitions. [2022-12-13 16:51:02,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:51:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7528 transitions. [2022-12-13 16:51:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 16:51:02,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:02,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:02,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 16:51:02,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 16:51:02,275 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash 412574584, now seen corresponding path program 1 times [2022-12-13 16:51:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:02,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454296705] [2022-12-13 16:51:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 16:51:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:51:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:51:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 16:51:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:51:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 16:51:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:02,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454296705] [2022-12-13 16:51:02,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454296705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:02,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280215325] [2022-12-13 16:51:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:02,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:02,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:02,392 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:02,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 16:51:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:02,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:51:02,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:02,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:02,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280215325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:02,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:02,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-12-13 16:51:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041757334] [2022-12-13 16:51:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:02,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:51:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:02,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:51:02,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:51:02,573 INFO L87 Difference]: Start difference. First operand 5544 states and 7528 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:03,038 INFO L93 Difference]: Finished difference Result 10786 states and 14542 transitions. [2022-12-13 16:51:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:51:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 132 [2022-12-13 16:51:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:03,048 INFO L225 Difference]: With dead ends: 10786 [2022-12-13 16:51:03,048 INFO L226 Difference]: Without dead ends: 5544 [2022-12-13 16:51:03,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:51:03,055 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 292 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:03,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 143 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-12-13 16:51:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-12-13 16:51:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.247338065661047) internal successors, (5623), 4746 states have internal predecessors, (5623), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:51:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7512 transitions. [2022-12-13 16:51:03,427 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7512 transitions. Word has length 132 [2022-12-13 16:51:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:03,428 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7512 transitions. [2022-12-13 16:51:03,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7512 transitions. [2022-12-13 16:51:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-13 16:51:03,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:03,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:03,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 16:51:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 16:51:03,636 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -878588795, now seen corresponding path program 1 times [2022-12-13 16:51:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:03,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702272575] [2022-12-13 16:51:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:51:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 16:51:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:51:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:51:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 16:51:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 16:51:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702272575] [2022-12-13 16:51:03,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702272575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917197051] [2022-12-13 16:51:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:03,802 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:03,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 16:51:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:03,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:51:03,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:03,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:03,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917197051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:03,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:03,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 16:51:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513693001] [2022-12-13 16:51:03,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:03,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:51:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:51:03,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:51:03,892 INFO L87 Difference]: Start difference. First operand 5544 states and 7512 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:51:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:04,337 INFO L93 Difference]: Finished difference Result 11822 states and 16920 transitions. [2022-12-13 16:51:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:51:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 133 [2022-12-13 16:51:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:04,351 INFO L225 Difference]: With dead ends: 11822 [2022-12-13 16:51:04,351 INFO L226 Difference]: Without dead ends: 6580 [2022-12-13 16:51:04,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:51:04,359 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 34 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:04,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-12-13 16:51:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5656. [2022-12-13 16:51:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4620 states have (on average 1.2482683982683982) internal successors, (5767), 4858 states have internal predecessors, (5767), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:51:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7656 transitions. [2022-12-13 16:51:04,766 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7656 transitions. Word has length 133 [2022-12-13 16:51:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:04,766 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7656 transitions. [2022-12-13 16:51:04,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:51:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7656 transitions. [2022-12-13 16:51:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-13 16:51:04,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:04,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:04,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 16:51:04,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 16:51:04,975 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1371214969, now seen corresponding path program 1 times [2022-12-13 16:51:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:04,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272637502] [2022-12-13 16:51:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:51:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 16:51:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:51:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:51:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 16:51:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 16:51:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:05,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272637502] [2022-12-13 16:51:05,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272637502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:05,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087363930] [2022-12-13 16:51:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:05,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:05,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:05,151 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:05,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 16:51:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:05,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:51:05,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:05,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:05,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087363930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:05,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:05,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-12-13 16:51:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578818884] [2022-12-13 16:51:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:51:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:51:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:05,285 INFO L87 Difference]: Start difference. First operand 5656 states and 7656 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:05,800 INFO L93 Difference]: Finished difference Result 11010 states and 14798 transitions. [2022-12-13 16:51:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:51:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 133 [2022-12-13 16:51:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:05,810 INFO L225 Difference]: With dead ends: 11010 [2022-12-13 16:51:05,810 INFO L226 Difference]: Without dead ends: 5656 [2022-12-13 16:51:05,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:05,817 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 301 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:05,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 160 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-12-13 16:51:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5656. [2022-12-13 16:51:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4620 states have (on average 1.2413419913419914) internal successors, (5735), 4858 states have internal predecessors, (5735), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:51:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7624 transitions. [2022-12-13 16:51:06,253 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7624 transitions. Word has length 133 [2022-12-13 16:51:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:06,253 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7624 transitions. [2022-12-13 16:51:06,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7624 transitions. [2022-12-13 16:51:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 16:51:06,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:06,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:06,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-13 16:51:06,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 16:51:06,466 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1497129402, now seen corresponding path program 1 times [2022-12-13 16:51:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:06,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207752193] [2022-12-13 16:51:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:06,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 16:51:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:51:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 16:51:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 16:51:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 16:51:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 16:51:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:06,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207752193] [2022-12-13 16:51:06,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207752193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:06,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761957610] [2022-12-13 16:51:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:06,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:06,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:06,656 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:06,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 16:51:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:06,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:51:06,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:06,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761957610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:06,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-12-13 16:51:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108045273] [2022-12-13 16:51:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:06,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:51:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:51:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:06,824 INFO L87 Difference]: Start difference. First operand 5656 states and 7624 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:07,373 INFO L93 Difference]: Finished difference Result 10898 states and 14606 transitions. [2022-12-13 16:51:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:51:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2022-12-13 16:51:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:07,383 INFO L225 Difference]: With dead ends: 10898 [2022-12-13 16:51:07,383 INFO L226 Difference]: Without dead ends: 5544 [2022-12-13 16:51:07,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:07,390 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 274 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:07,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 144 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-12-13 16:51:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-12-13 16:51:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4508 states have (on average 1.236690328305235) internal successors, (5575), 4746 states have internal predecessors, (5575), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1420), 500 states have call predecessors, (1420), 469 states have call successors, (1420) [2022-12-13 16:51:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7464 transitions. [2022-12-13 16:51:07,816 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7464 transitions. Word has length 134 [2022-12-13 16:51:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:07,816 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7464 transitions. [2022-12-13 16:51:07,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7464 transitions. [2022-12-13 16:51:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 16:51:07,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:07,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:07,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 16:51:08,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:08,025 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1907659227, now seen corresponding path program 1 times [2022-12-13 16:51:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:08,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473442101] [2022-12-13 16:51:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:51:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:51:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:51:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 16:51:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 16:51:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 16:51:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 16:51:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:08,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473442101] [2022-12-13 16:51:08,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473442101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:08,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:51:08,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:51:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908415567] [2022-12-13 16:51:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:08,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:51:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:08,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:51:08,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:51:08,131 INFO L87 Difference]: Start difference. First operand 5544 states and 7464 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:08,915 INFO L93 Difference]: Finished difference Result 12062 states and 17168 transitions. [2022-12-13 16:51:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:51:08,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-12-13 16:51:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:08,930 INFO L225 Difference]: With dead ends: 12062 [2022-12-13 16:51:08,930 INFO L226 Difference]: Without dead ends: 6820 [2022-12-13 16:51:08,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:51:08,939 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 226 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 330 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:51:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-12-13 16:51:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 5656. [2022-12-13 16:51:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 4604 states have (on average 1.2317549956559513) internal successors, (5671), 4858 states have internal predecessors, (5671), 469 states have call successors, (469), 313 states have call predecessors, (469), 582 states have return successors, (1428), 500 states have call predecessors, (1428), 469 states have call successors, (1428) [2022-12-13 16:51:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7568 transitions. [2022-12-13 16:51:09,430 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7568 transitions. Word has length 135 [2022-12-13 16:51:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:09,430 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7568 transitions. [2022-12-13 16:51:09,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7568 transitions. [2022-12-13 16:51:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 16:51:09,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:09,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:09,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 16:51:09,437 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1853266329, now seen corresponding path program 1 times [2022-12-13 16:51:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750252276] [2022-12-13 16:51:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:51:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:51:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 16:51:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 16:51:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 16:51:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 16:51:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:09,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:09,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750252276] [2022-12-13 16:51:09,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750252276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:09,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:51:09,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:51:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041013500] [2022-12-13 16:51:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:09,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:51:09,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:09,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:51:09,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:51:09,519 INFO L87 Difference]: Start difference. First operand 5656 states and 7568 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:10,671 INFO L93 Difference]: Finished difference Result 13294 states and 18642 transitions. [2022-12-13 16:51:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:51:10,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-12-13 16:51:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:10,687 INFO L225 Difference]: With dead ends: 13294 [2022-12-13 16:51:10,687 INFO L226 Difference]: Without dead ends: 7940 [2022-12-13 16:51:10,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:51:10,696 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 297 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:10,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 417 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:51:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2022-12-13 16:51:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7204. [2022-12-13 16:51:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 5964 states have (on average 1.2459758551307847) internal successors, (7431), 6326 states have internal predecessors, (7431), 517 states have call successors, (517), 361 states have call predecessors, (517), 722 states have return successors, (2244), 532 states have call predecessors, (2244), 517 states have call successors, (2244) [2022-12-13 16:51:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 10192 transitions. [2022-12-13 16:51:11,303 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 10192 transitions. Word has length 135 [2022-12-13 16:51:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:11,303 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 10192 transitions. [2022-12-13 16:51:11,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 10192 transitions. [2022-12-13 16:51:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 16:51:11,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:11,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:11,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 16:51:11,311 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1576268195, now seen corresponding path program 1 times [2022-12-13 16:51:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:11,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237022130] [2022-12-13 16:51:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:51:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:51:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:51:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 16:51:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:51:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:51:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 16:51:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:11,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237022130] [2022-12-13 16:51:11,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237022130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:11,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052783243] [2022-12-13 16:51:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:11,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:11,423 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:11,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 16:51:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:11,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:51:11,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 16:51:11,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:51:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 16:51:11,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052783243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:51:11,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:51:11,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-12-13 16:51:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688978325] [2022-12-13 16:51:11,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:51:11,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 16:51:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 16:51:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:11,733 INFO L87 Difference]: Start difference. First operand 7204 states and 10192 transitions. Second operand has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-12-13 16:51:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:13,939 INFO L93 Difference]: Finished difference Result 19309 states and 27520 transitions. [2022-12-13 16:51:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 16:51:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 138 [2022-12-13 16:51:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:13,961 INFO L225 Difference]: With dead ends: 19309 [2022-12-13 16:51:13,961 INFO L226 Difference]: Without dead ends: 12287 [2022-12-13 16:51:13,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 16:51:13,974 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1563 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:13,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 401 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 16:51:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2022-12-13 16:51:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 11183. [2022-12-13 16:51:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 9459 states have (on average 1.2225393804841949) internal successors, (11564), 9951 states have internal predecessors, (11564), 675 states have call successors, (675), 565 states have call predecessors, (675), 1048 states have return successors, (2589), 674 states have call predecessors, (2589), 675 states have call successors, (2589) [2022-12-13 16:51:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 14828 transitions. [2022-12-13 16:51:14,937 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 14828 transitions. Word has length 138 [2022-12-13 16:51:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:14,937 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 14828 transitions. [2022-12-13 16:51:14,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.0) internal successors, (208), 10 states have internal predecessors, (208), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2022-12-13 16:51:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 14828 transitions. [2022-12-13 16:51:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 16:51:14,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:51:14,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:51:14,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 16:51:15,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:15,145 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:51:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:51:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 700165149, now seen corresponding path program 1 times [2022-12-13 16:51:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:51:15,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530208097] [2022-12-13 16:51:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:51:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 16:51:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:51:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:51:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:51:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 16:51:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:51:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:51:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:51:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 16:51:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:51:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:51:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:51:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:51:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530208097] [2022-12-13 16:51:15,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530208097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:51:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463202599] [2022-12-13 16:51:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:51:15,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:51:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:51:15,269 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:51:15,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 16:51:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:51:15,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:51:15,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:51:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:51:15,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:51:15,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463202599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:51:15,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:51:15,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-12-13 16:51:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494973028] [2022-12-13 16:51:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:51:15,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:51:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:51:15,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:51:15,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:15,396 INFO L87 Difference]: Start difference. First operand 11183 states and 14828 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:51:15,755 INFO L93 Difference]: Finished difference Result 14412 states and 18889 transitions. [2022-12-13 16:51:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:51:15,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2022-12-13 16:51:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:51:15,757 INFO L225 Difference]: With dead ends: 14412 [2022-12-13 16:51:15,758 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 16:51:15,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 16:51:15,775 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 199 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:51:15,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 170 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:51:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 16:51:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 16:51:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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 16:51:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 16:51:15,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2022-12-13 16:51:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:51:15,777 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 16:51:15,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:51:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 16:51:15,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 16:51:15,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 16:51:15,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 16:51:15,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 16:51:15,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 16:51:37,065 WARN L233 SmtUtils]: Spent 8.64s on a formula simplification. DAG size of input: 845 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 16:51:50,032 WARN L233 SmtUtils]: Spent 10.98s on a formula simplification. DAG size of input: 989 DAG size of output: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 16:52:10,925 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 529 DAG size of output: 163 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 16:52:22,434 WARN L233 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 584 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-13 16:52:28,634 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~b0_ev~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (not (<= 2 ~b0_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-12-13 16:52:28,635 INFO L895 garLoopResultBuilder]: At program point L129(lines 106 131) the Hoare annotation is: (let ((.cse14 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse0 (not (<= ~comp_m1_i~0 0))) (.cse1 (not (<= 1 ~d1_val_t~0))) (.cse2 (not (<= 1 ~d0_val_t~0))) (.cse3 (not (<= 2 ~b0_ev~0))) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0))) (.cse13 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (= ~d1_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse4 (not (= ~b0_ev~0 1)) .cse5 .cse6 (and .cse14 .cse13) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 (not (= ~d0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-13 16:52:28,635 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-12-13 16:52:28,635 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L895 garLoopResultBuilder]: At program point is_method1_triggered_returnLabel#1(lines 103 132) the Hoare annotation is: (let ((.cse15 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse16 (<= 1 |activate_threads_is_method1_triggered_#res#1|)) (.cse17 (<= 1 |activate_threads_is_method1_triggered_~__retres1~0#1|))) (let ((.cse5 (and .cse15 .cse16 .cse17)) (.cse13 (and .cse16 .cse17)) (.cse0 (not (<= ~comp_m1_i~0 0))) (.cse1 (not (<= 1 ~d1_val_t~0))) (.cse2 (not (<= 1 ~d0_val_t~0))) (.cse14 (not (<= 2 ~b0_ev~0))) (.cse3 (not (= ~z_val~0 ~z_val_t~0))) (.cse4 (not (<= 2 ~z_ev~0))) (.cse6 (not (= ~z_val~0 0))) (.cse7 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse8 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse9 (not (<= 1 ~b0_val_t~0))) (.cse10 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse11 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse12 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~b0_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse14 (not (= ~d0_ev~0 1)) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse15 .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (not (= ~d1_ev~0 1)) .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-12-13 16:52:28,636 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2022-12-13 16:52:28,637 INFO L895 garLoopResultBuilder]: At program point L275(lines 267 277) the Hoare annotation is: (let ((.cse2 (not (<= ~d1_ev~0 0))) (.cse19 (not (<= 2 ~b1_ev~0))) (.cse20 (not (<= ~d0_ev~0 0))) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse5 (not (<= 2 ~b0_ev~0))) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse7 (not (<= 2 ~z_ev~0))) (.cse8 (not (= ~z_val~0 0))) (.cse18 (not (<= 2 ~d1_ev~0))) (.cse9 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse10 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse11 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse13 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse14 (not (<= ~b1_ev~0 0))) (.cse15 (not (<= 2 ~d0_ev~0))) (.cse16 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse17 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse16 .cse20 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 264 278) no Hoare annotation was computed. [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-12-13 16:52:28,637 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (let ((.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= |old(~z_ev~0)| ~z_ev~0)) (.cse25 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse17 (not (<= |old(~d1_ev~0)| 0))) (.cse1 (not (= |old(~b0_ev~0)| 0))) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse20 (not (<= |old(~d0_ev~0)| 0))) (.cse14 (and .cse22 .cse23 .cse24 (= ~b0_ev~0 0) .cse25)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse2 (not (<= ~comp_m1_i~0 0))) (.cse3 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse5 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse18 (and .cse22 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse23 .cse24 .cse25)) (.cse7 (not (= ~z_val~0 0))) (.cse19 (not (<= 2 |old(~b1_ev~0)|))) (.cse9 (not (<= 2 |old(~d0_ev~0)|))) (.cse10 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse11 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse12 (not (<= 1 ~b0_val_t~0))) (.cse13 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse15 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse21 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse17 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse21 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16)))) [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-12-13 16:52:28,637 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L895 garLoopResultBuilder]: At program point update_z_returnLabel#1(lines 193 207) the Hoare annotation is: (let ((.cse52 (<= ~d1_ev~0 0)) (.cse35 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse37 (<= 2 ~d0_ev~0)) (.cse39 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse54 (<= ~b1_ev~0 0)) (.cse32 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse27 (<= ~comp_m1_i~0 0)) (.cse57 (= ~z_val~0 ~z_val_t~0)) (.cse28 (<= 2 ~z_ev~0)) (.cse29 (<= 2 ~b1_ev~0)) (.cse53 (<= ~d0_ev~0 0)) (.cse58 (= |old(~z_val~0)| ~z_val~0)) (.cse30 (<= ~d0_val_t~0 ~d0_val~0)) (.cse31 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse59 (<= 1 ~d0_val_t~0)) (.cse56 (<= 1 ~b0_val_t~0)) (.cse33 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse34 (<= 2 ~d1_ev~0)) (.cse36 (<= ~b1_val_t~0 ~b1_val~0)) (.cse38 (<= ~b0_val_t~0 ~b0_val~0)) (.cse55 (<= 1 ~b1_val_t~0)) (.cse40 (= ~z_val~0 0)) (.cse45 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse41 (<= ~d1_val_t~0 ~d1_val~0)) (.cse60 (<= 1 ~d1_val_t~0)) (.cse42 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse46 (= ~b0_ev~0 0)) (.cse47 (<= ~b1_ev~0 |old(~b1_ev~0)|))) (let ((.cse10 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse31 .cse59 .cse56 .cse33 .cse34 .cse36 .cse38 .cse55 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46 .cse47)) (.cse22 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse31 .cse59 .cse32 .cse33 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42 .cse47)) (.cse2 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse31 .cse59 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46)) (.cse25 (and .cse27 .cse28 .cse54 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42)) (.cse12 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse31 .cse59 .cse32 .cse34 .cse36 .cse38 .cse40 .cse45 .cse41 .cse60 .cse42)) (.cse44 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse31 .cse59 .cse56 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse60 .cse42 .cse46)) (.cse5 (not (<= 2 |old(~d1_ev~0)|))) (.cse24 (and .cse27 .cse57 .cse28 .cse29 .cse30 .cse52 .cse31 .cse59 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse47)) (.cse26 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse52 .cse31 .cse59 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse46)) (.cse11 (not (<= 2 |old(~b1_ev~0)|))) (.cse43 (not (<= 2 |old(~d0_ev~0)|))) (.cse13 (and .cse27 .cse28 .cse29 .cse53 .cse30 .cse52 .cse31 .cse32 .cse33 .cse36 .cse38 .cse40 .cse41 .cse47)) (.cse15 (and .cse27 .cse57 .cse28 .cse29 .cse53 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse33 .cse36 .cse38 .cse40 .cse41 .cse60 .cse46 .cse47)) (.cse48 (and .cse27 .cse57 .cse28 .cse54 .cse58 .cse30 .cse52 .cse31 .cse59 .cse32 .cse56 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60)) (.cse49 (and .cse27 .cse57 .cse28 .cse29 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse60 .cse46 .cse47)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not .cse27)) (.cse3 (not .cse60)) (.cse4 (not .cse59)) (.cse50 (not (<= |old(~d1_ev~0)| 0))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse9 (and .cse27 .cse57 .cse28 .cse54 .cse53 .cse58 .cse30 .cse52 .cse31 .cse59 .cse56 .cse36 .cse38 .cse40 .cse41 .cse60 .cse46)) (.cse51 (not (<= |old(~b1_ev~0)| 0))) (.cse14 (not .cse56)) (.cse16 (not (<= |old(~d0_ev~0)| 0))) (.cse17 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse18 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse19 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse20 (not (<= 2 |old(~b0_ev~0)|))) (.cse21 (and .cse27 .cse28 .cse54 .cse53 .cse30 .cse52 .cse31 .cse32 .cse36 .cse38 .cse40 .cse41)) (.cse23 (not .cse55))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse25 .cse7 .cse8 .cse26 .cse9 (and .cse27 .cse28 (= ~d1_ev~0 |old(~d1_ev~0)|) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (= |old(~z_ev~0)| ~z_ev~0) .cse41 .cse42 (= |old(~b1_ev~0)| ~b1_ev~0)) .cse10 .cse11 .cse43 .cse12 .cse13 .cse14 .cse44 .cse15 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse17 .cse18 .cse48 .cse49 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse51 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse26 .cse9 .cse51 .cse43 .cse12 .cse14 .cse44 .cse17 .cse18 .cse48 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse26 .cse9 .cse51 .cse43 .cse14 .cse17 .cse18 .cse48 .cse19 .cse20 .cse21 .cse23) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 (and .cse30 .cse52 .cse31 .cse33 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse46 .cse47) (and .cse53 .cse30 .cse31 .cse33 .cse36 .cse38 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse3 .cse4 (and .cse53 .cse30 .cse52 .cse31 .cse33 .cse36 .cse38 .cse40 .cse41 .cse46 .cse47) (and .cse30 .cse31 .cse33 .cse35 .cse36 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46 .cse47) .cse5 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 (and .cse54 .cse53 .cse30 .cse31 .cse36 .cse38 .cse40 .cse45 .cse41 .cse42 .cse46) (and .cse54 .cse30 .cse52 .cse31 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse46) .cse11 .cse43 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (and .cse54 .cse53 .cse30 .cse52 .cse31 .cse36 .cse38 .cse40 .cse41 .cse46) (not (= |old(~b1_req_up~0)| 1)) .cse20 (and .cse54 .cse30 .cse31 .cse35 .cse36 .cse38 .cse39 .cse40 .cse45 .cse41 .cse42 .cse46) .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse24 .cse7 .cse8 .cse26 .cse9 .cse11 .cse43 .cse13 .cse14 .cse15 .cse17 .cse18 .cse48 .cse49 .cse19 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse50 .cse6 .cse7 .cse8 .cse9 .cse51 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23)))) [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2022-12-13 16:52:28,638 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-12-13 16:52:28,639 INFO L895 garLoopResultBuilder]: At program point update_b1_returnLabel#1(lines 148 162) the Hoare annotation is: (let ((.cse40 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse41 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse52 (<= 2 ~d1_ev~0)) (.cse55 (<= 2 ~b0_ev~0)) (.cse46 (= ~z_val~0 ~z_val_t~0)) (.cse48 (= |old(~z_val~0)| ~z_val~0)) (.cse57 (<= ~d1_ev~0 0)) (.cse50 (<= 1 ~d0_val_t~0)) (.cse44 (<= 1 ~b0_val_t~0)) (.cse56 (<= 1 ~d1_val_t~0)) (.cse38 (= ~b0_ev~0 0)) (.cse45 (<= ~comp_m1_i~0 0)) (.cse47 (<= 2 ~z_ev~0)) (.cse27 (<= ~b1_ev~0 0)) (.cse49 (<= ~d0_val_t~0 ~d0_val~0)) (.cse28 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse51 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse29 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse30 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse53 (<= 2 ~d0_ev~0)) (.cse32 (<= ~b0_val_t~0 ~b0_val~0)) (.cse33 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse34 (= ~z_val~0 0)) (.cse35 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse54 (<= ~d1_val_t~0 ~d1_val~0)) (.cse36 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse37 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse39 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse18 (and .cse45 .cse47 .cse27 .cse49 .cse28 .cse51 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse39)) (.cse20 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse44 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse24 (and .cse45 .cse46 .cse47 .cse27 (<= ~d0_ev~0 0) .cse48 .cse49 .cse28 .cse50 .cse51 .cse44 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse55 .cse36 .cse56 .cse37 .cse39)) (.cse26 (and .cse45 .cse46 .cse47 .cse27 .cse49 .cse28 .cse50 .cse52 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse4 (not (<= |old(~d1_ev~0)| 0))) (.cse22 (and .cse49 .cse28 .cse40 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse38 .cse39 .cse41)) (.cse9 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse38 .cse39)) (.cse23 (not (<= 2 |old(~b1_ev~0)|))) (.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse25 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse49 .cse51 .cse30 .cse31 .cse32 (= |old(~d0_ev~0)| ~d0_ev~0) .cse34 (= |old(~z_ev~0)| ~z_ev~0) .cse54 .cse36 (= |old(~b1_ev~0)| ~b1_ev~0) .cse39)) (.cse17 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse57 .cse28 .cse50 .cse51 .cse44 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse56 .cse37 .cse39)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not .cse45)) (.cse42 (and .cse45 .cse47 .cse27 .cse49 .cse28 .cse52 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse36 .cse37 .cse38 .cse39)) (.cse2 (not .cse56)) (.cse3 (not .cse50)) (.cse21 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse43 (and .cse45 .cse46 .cse47 .cse27 .cse48 .cse49 .cse28 .cse50 .cse51 .cse44 .cse52 .cse29 .cse30 .cse31 .cse53 .cse32 .cse33 .cse34 .cse35 .cse54 .cse55 .cse36 .cse56 .cse37 .cse39)) (.cse10 (not .cse44)) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse22 .cse23 .cse10 .cse24 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 .cse23 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (not (= |old(~b1_req_up~0)| 1)) .cse15 (and .cse28 .cse40 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41) .cse16) (or .cse0 .cse1 .cse42 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse22 .cse23 .cse19 .cse43 .cse10 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse23 .cse19 .cse10 .cse20 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse42 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse19 .cse43 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-12-13 16:52:28,639 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-12-13 16:52:28,639 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-12-13 16:52:28,639 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2022-12-13 16:52:28,640 INFO L895 garLoopResultBuilder]: At program point update_b0_returnLabel#1(lines 133 147) the Hoare annotation is: (let ((.cse21 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse22 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse23 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse26 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse28 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse30 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= ~b0_ev~0 0)) (.cse33 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse34 (<= ~d0_val_t~0 ~d0_val~0)) (.cse35 (<= ~b1_val_t~0 ~b1_val~0)) (.cse24 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse25 (<= ~b0_val_t~0 ~b0_val~0)) (.cse27 (= ~z_val~0 0)) (.cse36 (<= ~d1_val_t~0 ~d1_val~0)) (.cse37 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse18 (not (<= |old(~d1_ev~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse8 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse34 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse35 .cse24 .cse25 (= |old(~d0_ev~0)| ~d0_ev~0) .cse27 (= |old(~z_ev~0)| ~z_ev~0) .cse36 .cse37 .cse29 (= |old(~b1_ev~0)| ~b1_ev~0) .cse32)) (.cse20 (not (<= |old(~b1_ev~0)| 0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse15 (and .cse34 .cse21 .cse22 .cse23 .cse35 .cse24 .cse25 .cse26 .cse27 .cse28 .cse36 .cse37 .cse29 .cse30 .cse31 .cse32 .cse33)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse4 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse9 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse16 (not (<= 2 |old(~b0_ev~0)|))) (.cse17 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 .cse9 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= 1 ~b1_req_up~0) .cse32 .cse33) .cse16 .cse17)))) [2022-12-13 16:52:28,640 INFO L895 garLoopResultBuilder]: At program point update_d1_returnLabel#1(lines 178 192) the Hoare annotation is: (let ((.cse52 (<= 1 ~b1_val_t~0)) (.cse47 (<= ~b1_ev~0 0)) (.cse42 (<= ~d1_ev~0 0)) (.cse58 (<= 1 ~b0_val_t~0)) (.cse50 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse61 (<= 2 ~d0_ev~0)) (.cse51 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse45 (= ~b0_ev~0 0)) (.cse53 (<= ~comp_m1_i~0 0)) (.cse54 (= ~z_val~0 ~z_val_t~0)) (.cse55 (<= 2 ~z_ev~0)) (.cse62 (<= 2 ~b1_ev~0)) (.cse41 (<= ~d0_ev~0 0)) (.cse56 (= |old(~z_val~0)| ~z_val~0)) (.cse32 (<= ~d0_val_t~0 ~d0_val~0)) (.cse43 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse57 (<= 1 ~d0_val_t~0)) (.cse33 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse44 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse59 (<= 2 ~d1_ev~0)) (.cse34 (<= ~b1_val_t~0 ~b1_val~0)) (.cse35 (<= ~b0_val_t~0 ~b0_val~0)) (.cse36 (= ~z_val~0 0)) (.cse48 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse37 (<= ~d1_val_t~0 ~d1_val~0)) (.cse38 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse60 (<= 1 ~d1_val_t~0)) (.cse49 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse46 (<= ~b1_ev~0 |old(~b1_ev~0)|))) (let ((.cse21 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse43 .cse57 .cse33 .cse44 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse46)) (.cse22 (and .cse53 .cse55 .cse62 .cse41 .cse32 .cse43 .cse44 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45 .cse46)) (.cse26 (and .cse53 .cse54 .cse55 .cse62 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse58 .cse44 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse46)) (.cse28 (and .cse53 .cse54 .cse55 .cse62 .cse32 .cse42 .cse43 .cse57 .cse44 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse45 .cse46)) (.cse18 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse46)) (.cse20 (and .cse53 .cse54 .cse55 .cse62 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse45 .cse46)) (.cse5 (not (<= |old(~d1_ev~0)| 0))) (.cse19 (not (<= 2 |old(~b1_ev~0)|))) (.cse40 (and .cse32 .cse43 .cse44 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45 .cse46)) (.cse12 (not (<= |old(~d0_ev~0)| 0))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse42 .cse43 .cse57 .cse58 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60 .cse45)) (.cse2 (not .cse53)) (.cse3 (not .cse60)) (.cse4 (not .cse57)) (.cse23 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse31 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse43 .cse57 .cse33 .cse59 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49)) (.cse27 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse42 .cse43 .cse57 .cse58 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 .cse38 .cse60 .cse45)) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse29 (and .cse53 .cse54 .cse55 .cse47 .cse56 .cse32 .cse42 .cse43 .cse57 .cse33 .cse58 .cse50 .cse34 .cse61 .cse35 .cse51 .cse36 .cse37 (<= 2 ~b0_ev~0) .cse38 .cse60)) (.cse9 (not (<= |old(~b1_ev~0)| 0))) (.cse39 (and .cse53 .cse54 .cse55 .cse47 .cse32 .cse43 .cse57 .cse59 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45)) (.cse10 (and .cse53 .cse55 .cse47 .cse41 .cse32 .cse42 .cse43 .cse57 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse60)) (.cse30 (not (<= 2 |old(~d0_ev~0)|))) (.cse11 (not .cse58)) (.cse24 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse43 .cse57 .cse33 .cse58 .cse59 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49)) (.cse13 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse14 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse15 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse25 (and .cse53 .cse54 .cse55 .cse47 .cse41 .cse56 .cse32 .cse43 .cse57 .cse58 .cse59 .cse34 .cse35 .cse52 .cse36 .cse48 .cse37 .cse38 .cse60 .cse49 .cse45)) (.cse16 (not (<= 2 |old(~b0_ev~0)|))) (.cse17 (not .cse52))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse11 .cse20 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse28 .cse18 .cse29 .cse19 .cse10 .cse30 .cse11 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse21 .cse2 .cse22 .cse26 .cse3 .cse4 .cse23 .cse6 .cse31 .cse27 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse32 .cse33 .cse34 .cse35 (= |old(~d0_ev~0)| ~d0_ev~0) .cse36 (= |old(~z_ev~0)| ~z_ev~0) .cse37 .cse38 (= |old(~b1_ev~0)| ~b1_ev~0)) .cse7 .cse8 .cse28 .cse18 .cse29 .cse19 .cse39 .cse10 .cse30 .cse11 .cse20 .cse24 .cse13 .cse14 .cse15 .cse25 .cse40 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse29 .cse9 .cse10 .cse30 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (or (not (= ~comp_m1_st~0 0)) .cse0 (and .cse41 .cse32 .cse42 .cse43 .cse44 .cse34 .cse35 .cse36 .cse37 .cse38 .cse45 .cse46) .cse2 .cse3 .cse4 (and .cse47 .cse41 .cse32 .cse42 .cse43 .cse34 .cse35 .cse36 .cse37 .cse38 .cse45) .cse23 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 (and .cse41 .cse32 .cse43 .cse44 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45 .cse46) (and .cse47 .cse32 .cse43 .cse50 .cse34 .cse35 .cse51 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45) .cse19 (and .cse47 .cse41 .cse32 .cse43 .cse34 .cse35 .cse36 .cse48 .cse37 .cse38 .cse49 .cse45) .cse30 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) (and .cse32 .cse42 .cse43 .cse44 .cse50 .cse34 .cse35 .cse51 .cse36 .cse37 .cse38 .cse45 .cse46) .cse40 .cse16 .cse17 (and .cse47 .cse32 .cse42 .cse43 .cse50 .cse34 .cse35 .cse51 .cse36 .cse37 .cse38 .cse45)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse31 .cse27 .cse7 .cse8 .cse29 .cse9 .cse39 .cse10 .cse30 .cse11 .cse24 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17)))) [2022-12-13 16:52:28,641 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse20 (= |old(~d1_val~0)| ~d1_val~0)) (.cse21 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse22 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse25 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse26 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~z_val~0 0)) (.cse28 (= |old(~z_ev~0)| ~z_ev~0)) (.cse29 (= |old(~d0_val~0)| ~d0_val~0)) (.cse30 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse31 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse32 (= |old(~b0_val~0)| ~b0_val~0)) (.cse33 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse11 (not (<= |old(~d0_ev~0)| 0))) (.cse3 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse30 .cse31 .cse32 .cse33)) (.cse5 (not (<= |old(~d1_ev~0)| 0))) (.cse8 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse18 (not (<= |old(~b1_ev~0)| 0))) (.cse10 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse13 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse14 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse4 (not (<= 1 ~d0_val_t~0))) (.cse17 (not (<= 2 |old(~d1_ev~0)|))) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse7 (not (= |old(~z_val~0)| 0))) (.cse9 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 .cse1 .cse2 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= 1 ~b1_req_up~0) .cse32 .cse33) .cse4 .cse17 .cse6 (not (= |old(~d0_req_up~0)| 1)) .cse7 .cse9 .cse19 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse15 .cse16)))) [2022-12-13 16:52:28,641 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-12-13 16:52:28,641 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-12-13 16:52:28,641 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2022-12-13 16:52:28,641 INFO L895 garLoopResultBuilder]: At program point update_d0_returnLabel#1(lines 163 177) the Hoare annotation is: (let ((.cse58 (<= 1 ~b1_val_t~0)) (.cse57 (<= 2 ~d1_ev~0)) (.cse60 (<= 2 ~b1_ev~0)) (.cse24 (<= |old(~b1_ev~0)| ~b1_ev~0)) (.cse33 (<= ~b1_ev~0 |old(~b1_ev~0)|)) (.cse21 (<= ~d0_ev~0 0)) (.cse51 (= ~z_val~0 ~z_val_t~0)) (.cse53 (= |old(~z_val~0)| ~z_val~0)) (.cse61 (<= ~d1_ev~0 0)) (.cse54 (<= 1 ~d0_val_t~0)) (.cse55 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse56 (<= 1 ~b0_val_t~0)) (.cse59 (<= 1 ~d1_val_t~0)) (.cse50 (<= ~comp_m1_i~0 0)) (.cse52 (<= 2 ~z_ev~0)) (.cse34 (<= ~b1_ev~0 0)) (.cse22 (<= ~d0_val_t~0 ~d0_val~0)) (.cse23 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse35 (<= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse25 (<= ~b1_val_t~0 ~b1_val~0)) (.cse62 (<= 2 ~d0_ev~0)) (.cse26 (<= ~b0_val_t~0 ~b0_val~0)) (.cse36 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~z_val~0 0)) (.cse28 (<= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse49 (<= ~d1_val_t~0 ~d1_val~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse30 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= ~b0_ev~0 0)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (let ((.cse41 (and .cse50 .cse52 .cse34 .cse22 .cse23 .cse35 .cse25 .cse62 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32)) (.cse8 (not (<= |old(~b1_ev~0)| 0))) (.cse45 (and .cse50 .cse51 .cse52 .cse34 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse56 .cse35 .cse25 .cse62 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse18 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32)) (.cse19 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse56 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse20 (not (<= |old(~d1_ev~0)| 0))) (.cse43 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32 .cse33)) (.cse10 (not (<= |old(~d0_ev~0)| 0))) (.cse44 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse61 .cse23 .cse54 .cse55 .cse24 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32 .cse33)) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse39 (and .cse50 .cse52 .cse34 .cse22 .cse23 .cse57 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32)) (.cse1 (not .cse50)) (.cse2 (not .cse59)) (.cse3 (not .cse54)) (.cse4 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (<= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse37 (not (<= 2 |old(~b1_ev~0)|))) (.cse47 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse23 .cse54 .cse24 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32 .cse33)) (.cse40 (and .cse50 .cse51 .cse52 .cse34 .cse53 .cse22 .cse23 .cse54 .cse55 .cse57 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32)) (.cse38 (not (<= 2 |old(~d0_ev~0)|))) (.cse48 (and .cse50 .cse51 .cse52 .cse60 .cse21 .cse53 .cse22 .cse23 .cse54 .cse55 .cse24 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse32 .cse33)) (.cse9 (not .cse56)) (.cse42 (and (= ~d1_ev~0 |old(~d1_ev~0)|) .cse22 .cse55 .cse25 .cse26 (= |old(~d0_ev~0)| ~d0_ev~0) .cse27 (= |old(~z_ev~0)| ~z_ev~0) .cse49 .cse29 (= |old(~b1_ev~0)| ~b1_ev~0) .cse32)) (.cse11 (not (<= ~b0_val_t~0 |old(~b0_val~0)|))) (.cse12 (not (<= ~b1_val_t~0 |old(~b1_val~0)|))) (.cse13 (not (<= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse14 (not (<= 2 |old(~b0_ev~0)|))) (.cse15 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse23 .cse54 .cse57 .cse25 .cse26 .cse27 .cse28 .cse49 .cse29 .cse59 .cse30 .cse31 .cse32)) (.cse16 (not .cse58)) (.cse17 (and .cse50 .cse51 .cse52 .cse34 .cse21 .cse53 .cse22 .cse23 .cse54 .cse55 .cse56 .cse57 .cse25 .cse26 .cse58 .cse27 .cse28 .cse49 (<= 2 ~b0_ev~0) .cse29 .cse59 .cse30 .cse32)) (.cse46 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse49 .cse29 .cse30 .cse31 .cse32 .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or (not (= ~comp_m1_st~0 0)) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse0 .cse1 (and .cse34 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse2 (and .cse34 .cse22 .cse23 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse3 .cse4 .cse5 (not (= |old(~d0_req_up~0)| 1)) .cse6 (and .cse22 .cse23 .cse24 .cse35 .cse25 .cse26 .cse36 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse37 .cse38 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse14 .cse16) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse40 .cse38 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse41 .cse37 .cse38 .cse9 .cse42 .cse43 .cse11 .cse12 .cse44 .cse45 .cse13 .cse14 .cse16 .cse46) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse41 .cse8 .cse38 .cse9 .cse11 .cse12 .cse45 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse37 .cse47 .cse48 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse37 .cse9 .cse43 .cse10 .cse11 .cse12 .cse44 .cse13 .cse14 .cse16) (or .cse0 .cse39 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse37 .cse47 .cse40 .cse38 .cse48 .cse9 .cse42 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse46)))) [2022-12-13 16:52:28,641 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse17 (not (= ~comp_m1_st~0 0))) (.cse4 (not (<= |old(~d1_ev~0)| 0))) (.cse13 (not (<= |old(~d0_ev~0)| 0))) (.cse18 (not (<= |old(~b1_ev~0)| 0))) (.cse0 (not (<= 2 |old(~z_ev~0)|))) (.cse1 (not (<= ~comp_m1_i~0 0))) (.cse2 (not (<= 1 ~d1_val_t~0))) (.cse3 (not (<= 1 ~d0_val_t~0))) (.cse20 (not (<= 2 |old(~d1_ev~0)|))) (.cse5 (not (= ~z_val~0 ~z_val_t~0))) (.cse6 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~z_ev~0)| ~z_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (not (<= 2 |old(~b1_ev~0)|))) (.cse19 (not (<= 2 |old(~d0_ev~0)|))) (.cse9 (not (<= ~b1_val_t~0 ~b1_val~0))) (.cse10 (not (<= ~d0_val_t~0 ~d0_val~0))) (.cse11 (not (<= 1 ~b0_val_t~0))) (.cse12 (not (<= ~d1_val_t~0 ~d1_val~0))) (.cse14 (not (<= ~b0_val_t~0 ~b0_val~0))) (.cse15 (not (<= 2 |old(~b0_ev~0)|))) (.cse16 (not (<= 1 ~b1_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (not (= |old(~b0_ev~0)| 1)) .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16))) [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-12-13 16:52:28,642 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,643 INFO L895 garLoopResultBuilder]: At program point method1_returnLabel#1(lines 46 102) the Hoare annotation is: (let ((.cse6 (<= ~d1_ev~0 0)) (.cse3 (<= ~b1_ev~0 0)) (.cse18 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (<= ~d0_ev~0 0)) (.cse5 (<= ~d0_val_t~0 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= 1 ~b0_val_t~0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (= ~z_req_up~0 1)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse15 (<= 2 ~b0_ev~0)) (.cse16 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse5 .cse7 .cse8 .cse19 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse19 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-12-13 16:52:28,643 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 493 511) the Hoare annotation is: true [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L895 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 418 460) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0)) [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-12-13 16:52:28,643 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 16:52:28,644 INFO L895 garLoopResultBuilder]: At program point error_returnLabel#1(lines 15 22) the Hoare annotation is: false [2022-12-13 16:52:28,644 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,644 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-12-13 16:52:28,644 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-12-13 16:52:28,644 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-12-13 16:52:28,644 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,644 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2022-12-13 16:52:28,644 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,644 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 279 316) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,645 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse18 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse17 (<= 2 ~b0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse19 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,645 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= 1 ~d0_val_t~0)) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (= ~z_val~0 0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0)) (.cse11 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~b0_ev~0) .cse11))) [2022-12-13 16:52:28,645 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~comp_m1_st~0 0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-12-13 16:52:28,645 INFO L895 garLoopResultBuilder]: At program point L255-2(lines 251 263) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse16 (<= 2 ~d1_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse17 .cse4 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,645 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0)) (.cse14 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse15 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse17 (<= ~b1_ev~0 0)) (.cse19 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse13 (<= 2 ~b0_ev~0)) (.cse12 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse19 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse19 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse18 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12))) [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-12-13 16:52:28,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-12-13 16:52:28,646 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 461 492) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (= ~z_val~0 ~z_val_t~0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2022-12-13 16:52:28,646 INFO L895 garLoopResultBuilder]: At program point L414(lines 403 416) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,646 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 399 417) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (= ~z_val~0 ~z_val_t~0)) (.cse2 (<= 2 ~z_ev~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse18 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse18 .cse4 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-13 16:52:28,646 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-12-13 16:52:28,649 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:52:28,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:52:28,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:52:28 BoogieIcfgContainer [2022-12-13 16:52:28,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:52:28,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:52:28,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:52:28,754 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:52:28,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:50:30" (3/4) ... [2022-12-13 16:52:28,757 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 16:52:28,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-12-13 16:52:28,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-13 16:52:28,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-12-13 16:52:28,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-12-13 16:52:28,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-12-13 16:52:28,769 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-12-13 16:52:28,770 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 16:52:28,771 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 16:52:28,772 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 16:52:28,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && ((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && 1 == b1_req_up) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-12-13 16:52:28,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && (((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || ((((((((((((b1_ev <= 0 && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-12-13 16:52:28,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && ((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((!(comp_m1_st == 0) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) [2022-12-13 16:52:28,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || ((((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) [2022-12-13 16:52:28,795 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && d1_ev == \old(d1_ev)) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && \old(b1_ev) == b1_ev)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || (((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t)) [2022-12-13 16:52:28,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1)) && (((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || !(z_val == 0)) || (comp_m1_st == \old(comp_m1_st) && 1 <= __retres1)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) [2022-12-13 16:52:28,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) [2022-12-13 16:52:28,836 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:52:28,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:52:28,836 INFO L158 Benchmark]: Toolchain (without parser) took 118930.25ms. Allocated memory was 134.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 101.0MB in the beginning and 1.0GB in the end (delta: -916.0MB). Peak memory consumption was 930.0MB. Max. memory is 16.1GB. [2022-12-13 16:52:28,837 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:52:28,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.12ms. Allocated memory is still 134.2MB. Free memory was 101.0MB in the beginning and 87.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 16:52:28,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.93ms. Allocated memory is still 134.2MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:52:28,837 INFO L158 Benchmark]: Boogie Preprocessor took 17.63ms. Allocated memory is still 134.2MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:52:28,838 INFO L158 Benchmark]: RCFGBuilder took 399.17ms. Allocated memory is still 134.2MB. Free memory was 83.7MB in the beginning and 65.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 16:52:28,838 INFO L158 Benchmark]: TraceAbstraction took 118198.54ms. Allocated memory was 134.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 65.4MB in the beginning and 1.0GB in the end (delta: -958.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-12-13 16:52:28,838 INFO L158 Benchmark]: Witness Printer took 82.19ms. Allocated memory is still 2.0GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 16:52:28,839 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.12ms. Allocated memory is still 134.2MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.12ms. Allocated memory is still 134.2MB. Free memory was 101.0MB in the beginning and 87.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.93ms. Allocated memory is still 134.2MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.63ms. Allocated memory is still 134.2MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.17ms. Allocated memory is still 134.2MB. Free memory was 83.7MB in the beginning and 65.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 118198.54ms. Allocated memory was 134.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 65.4MB in the beginning and 1.0GB in the end (delta: -958.9MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 82.19ms. Allocated memory is still 2.0GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 118.0s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 72.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6079 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6004 mSDsluCounter, 13785 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8707 mSDsCounter, 693 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5144 IncrementalHoareTripleChecker+Invalid, 5837 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 693 mSolverCounterUnsat, 5078 mSDtfsCounter, 5144 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4597 GetRequests, 4226 SyntacticMatches, 6 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11183occurred in iteration=33, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 14460 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 22312 PreInvPairs, 23589 NumberOfFragments, 24499 HoareAnnotationTreeSize, 22312 FomulaSimplifications, 111471 FormulaSimplificationTreeSizeReduction, 12.3s HoareSimplificationTime, 34 FomulaSimplificationsInter, 864480 FormulaSimplificationTreeSizeReductionInter, 60.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 7376 NumberOfCodeBlocks, 7320 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7448 ConstructedInterpolants, 0 QuantifiedInterpolants, 16593 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15898 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 66 InterpolantComputations, 33 PerfectInterpolantSequences, 2243/2459 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1)) && (((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || !(z_val == 0)) || (comp_m1_st == \old(comp_m1_st) && 1 <= __retres1)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) || 1 <= __retres1) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((((((!(comp_m1_i <= 0) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(z_val == z_val_t)) || !(b0_ev == 1)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(d0_ev == 1)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((comp_m1_st == \old(comp_m1_st) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && ((((((((((((((!(comp_m1_i <= 0) || !(d1_ev == 1)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || ((comp_m1_st == \old(comp_m1_st) && 1 <= \result) && 1 <= __retres1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((1 <= \result && 1 <= __retres1) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(b1_ev == 1)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && z_req_up == 1) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((comp_m1_i <= 0 && z_val == z_val_t) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && 2 <= b0_ev - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(d1_ev <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(2 <= b1_ev)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b0_val_t <= b0_val)) || !(d0_ev <= 0)) || !(1 <= b1_val_t))) && (((((((((((((((((!(comp_m1_st == 0) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= b0_ev)) || !(z_val == z_val_t)) || !(2 <= z_ev)) || !(z_val == 0)) || !(2 <= d1_ev)) || !(b1_val_t <= b1_val)) || !(d0_val_t <= d0_val)) || !(1 <= b0_val_t)) || !(d1_val_t <= d1_val)) || 1 <= __retres1) || !(b1_ev <= 0)) || !(2 <= d0_ev)) || !(b0_val_t <= b0_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && ((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((!(comp_m1_st == 0) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && ((((((((((((((((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) || !(2 <= \old(z_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || ((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(2 <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(d0_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || (((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || ((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && d1_ev == \old(d1_ev)) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && \old(b1_ev) == b1_ev)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(1 <= b0_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || (((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || (((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b0_ev == 0)) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || (((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && b1_ev <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || (((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val)) || !(1 <= b1_val_t)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 1 <= d1_val_t) && b0_ev == 0) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && ((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && 1 == b1_req_up) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b0_req_up == 1) && comp_m1_st == 0) && 2 <= b1_ev) && 1 <= d0_val_t) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && 2 <= d0_ev) && 1 <= b1_val_t) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 <= d1_val_t) && 1 == b1_req_up - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t)) || (((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && 1 <= d1_val_t) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) && (((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || ((((((((((((b1_ev <= 0 && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(\old(b1_req_up) == 1)) || !(2 <= \old(b0_ev))) || (((((((((((((\old(z_ev) <= z_ev && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b0_ev == \old(b0_ev)) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(1 <= b0_val_t)) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up)) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(2 <= \old(b1_ev))) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || ((((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev) && d1_req_up == \old(d1_req_up))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || ((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up)))) && (((((((((((((((((!(2 <= \old(z_ev)) || !(comp_m1_i <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && d1_req_up == \old(d1_req_up))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || !(2 <= \old(d0_ev))) || ((((((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && \old(d0_req_up) == d0_req_up) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && d1_req_up == \old(d1_req_up))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || (((((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || ((((((((((d1_ev == \old(d1_ev) && d0_val_t <= d0_val) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) == d0_ev) && z_val == 0) && \old(z_ev) == z_ev) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(b1_ev) == b1_ev)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b1_ev <= \old(b1_ev))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(b1_ev))) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && 2 <= b1_ev) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(\old(d1_ev) <= 0)) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((((!(comp_m1_st == 0) || !(2 <= \old(z_ev))) || (((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || ((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || ((((((((((((d0_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || ((((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b1_ev))) || (((((((((((b1_ev <= 0 && d0_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(d0_ev))) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_req_up) == 1)) || ((((((((((((d0_val_t <= d0_val && d1_ev <= 0) && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || (((((((((((((d0_val_t <= d0_val && \old(z_ev) <= z_ev) && \old(b1_ev) <= b1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && \old(d1_ev) <= d1_ev) && b0_ev == 0) && b1_ev <= \old(b1_ev))) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) || (((((((((((b1_ev <= 0 && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && b0_ev == 0))) && (((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || !(\old(b1_ev) <= 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(\old(d0_ev) <= 0)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t))) && (((((((((((((((((((((((!(2 <= \old(z_ev)) || (((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(comp_m1_i <= 0)) || !(1 <= d1_val_t)) || !(1 <= d0_val_t)) || !(2 <= \old(d1_ev))) || !(\old(z_val) == z_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && b0_ev == 0)) || !(\old(z_val) == 0)) || !(d1_val_t <= \old(d1_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && 2 <= d0_ev) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_val_t <= d1_val) && 2 <= b0_ev) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(\old(b1_ev) <= 0)) || ((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 2 <= d1_ev) && d0_ev <= \old(d0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && \old(d0_ev) <= d0_ev) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || ((((((((((((((comp_m1_i <= 0 && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && d0_val_t <= d0_val) && d1_ev <= 0) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t)) || !(2 <= \old(d0_ev))) || !(1 <= b0_val_t)) || (((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && b0_ev == \old(b0_ev)) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev)) || !(b0_val_t <= \old(b0_val))) || !(b1_val_t <= \old(b1_val))) || !(d0_val_t <= \old(d0_val))) || ((((((((((((((((((((comp_m1_i <= 0 && z_val == z_val_t) && 2 <= z_ev) && b1_ev <= 0) && d0_ev <= 0) && \old(z_val) == z_val) && d0_val_t <= d0_val) && \old(z_ev) <= z_ev) && 1 <= d0_val_t) && 1 <= b0_val_t) && 2 <= d1_ev) && b1_val_t <= b1_val) && b0_val_t <= b0_val) && 1 <= b1_val_t) && z_val == 0) && d1_ev <= \old(d1_ev)) && d1_val_t <= d1_val) && \old(z_req_up) == z_req_up) && 1 <= d1_val_t) && \old(d1_ev) <= d1_ev) && b0_ev == 0)) || !(2 <= \old(b0_ev))) || !(1 <= b1_val_t)) RESULT: Ultimate proved your program to be correct! [2022-12-13 16:52:28,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7741fd8a-85fe-4b0b-8060-4bff3d303206/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 Result: TRUE