./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 5e519f3a 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_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-5e519f3 [2022-11-02 20:42:54,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:42:54,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:42:54,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:42:54,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:42:54,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:42:54,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:42:54,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:42:54,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:42:54,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:42:54,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:42:54,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:42:54,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:42:54,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:42:54,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:42:54,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:42:54,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:42:54,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:42:54,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:42:54,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:42:54,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:42:54,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:42:54,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:42:54,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:42:54,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:42:54,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:42:54,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:42:54,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:42:54,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:42:54,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:42:54,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:42:54,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:42:54,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:42:54,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:42:54,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:42:54,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:42:54,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:42:54,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:42:54,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:42:54,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:42:54,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:42:54,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:42:54,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:42:54,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:42:54,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:42:54,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:42:54,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:42:54,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:42:54,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:42:54,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:42:54,563 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:42:54,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:42:54,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:42:54,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:42:54,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:42:54,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:42:54,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:42:54,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:42:54,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:42:54,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:42:54,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:42:54,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:42:54,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:42:54,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:42:54,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:42:54,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:42:54,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:54,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:42:54,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:42:54,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:42:54,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:42:54,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:42:54,570 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:42:54,570 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:42:54,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:42:54,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2022-11-02 20:42:54,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:42:54,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:42:54,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:42:54,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:42:54,865 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:42:54,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-11-02 20:42:54,945 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/data/1702786d1/6ed1fe9f91744910a01b7aeebdfc4b1b/FLAGccd474581 [2022-11-02 20:42:55,366 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:42:55,367 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-11-02 20:42:55,379 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/data/1702786d1/6ed1fe9f91744910a01b7aeebdfc4b1b/FLAGccd474581 [2022-11-02 20:42:55,758 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/data/1702786d1/6ed1fe9f91744910a01b7aeebdfc4b1b [2022-11-02 20:42:55,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:42:55,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:42:55,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:55,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:42:55,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:42:55,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:55" (1/1) ... [2022-11-02 20:42:55,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b025d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:55, skipping insertion in model container [2022-11-02 20:42:55,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:55" (1/1) ... [2022-11-02 20:42:55,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:42:55,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:42:56,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-11-02 20:42:56,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:56,186 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:42:56,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-11-02 20:42:56,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:56,262 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:42:56,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56 WrapperNode [2022-11-02 20:42:56,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:56,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:56,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:42:56,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:42:56,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,303 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2022-11-02 20:42:56,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:56,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:42:56,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:42:56,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:42:56,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,344 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:42:56,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:42:56,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:42:56,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:42:56,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (1/1) ... [2022-11-02 20:42:56,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:56,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:42:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:42:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-02 20:42:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-02 20:42:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-02 20:42:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-02 20:42:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-02 20:42:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-02 20:42:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-02 20:42:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-02 20:42:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:42:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-02 20:42:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-02 20:42:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:42:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:42:56,542 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:42:56,545 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:42:57,084 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:42:57,091 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:42:57,091 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:42:57,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:57 BoogieIcfgContainer [2022-11-02 20:42:57,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:42:57,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:42:57,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:42:57,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:42:57,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:42:55" (1/3) ... [2022-11-02 20:42:57,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4ee5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:42:57, skipping insertion in model container [2022-11-02 20:42:57,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:56" (2/3) ... [2022-11-02 20:42:57,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4ee5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:42:57, skipping insertion in model container [2022-11-02 20:42:57,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:57" (3/3) ... [2022-11-02 20:42:57,111 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2022-11-02 20:42:57,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:42:57,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:42:57,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:42:57,213 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;@228f0778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:42:57,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:42:57,218 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-11-02 20:42:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:42:57,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:57,228 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-11-02 20:42:57,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:42:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 129401130, now seen corresponding path program 1 times [2022-11-02 20:42:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:57,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089160348] [2022-11-02 20:42:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:42:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:42:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:57,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089160348] [2022-11-02 20:42:57,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089160348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:57,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:57,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:42:57,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863742820] [2022-11-02 20:42:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:57,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:42:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:42:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:57,917 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-11-02 20:42:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:58,868 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2022-11-02 20:42:58,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:42:58,876 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-11-02 20:42:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:58,887 INFO L225 Difference]: With dead ends: 281 [2022-11-02 20:42:58,888 INFO L226 Difference]: Without dead ends: 178 [2022-11-02 20:42:58,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:42:58,895 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 203 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:58,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 405 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:42:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-02 20:42:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 117. [2022-11-02 20:42:58,999 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-11-02 20:42:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2022-11-02 20:42:59,003 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 42 [2022-11-02 20:42:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:59,003 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2022-11-02 20:42:59,004 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-11-02 20:42:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2022-11-02 20:42:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:42:59,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:59,008 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-11-02 20:42:59,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:42:59,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:42:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1179475252, now seen corresponding path program 1 times [2022-11-02 20:42:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:59,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384860767] [2022-11-02 20:42:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:42:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:42:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:42:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:42:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:42:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:42:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:42:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:42:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:42:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:59,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384860767] [2022-11-02 20:42:59,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384860767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:59,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733164791] [2022-11-02 20:42:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:59,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:59,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:59,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:42:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:59,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:42:59,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:42:59,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:42:59,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733164791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:59,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:42:59,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-02 20:42:59,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599203776] [2022-11-02 20:42:59,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:59,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:42:59,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:59,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:42:59,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:42:59,640 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-11-02 20:42:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:59,685 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-11-02 20:42:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:42:59,699 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-11-02 20:42:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:59,701 INFO L225 Difference]: With dead ends: 227 [2022-11-02 20:42:59,701 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:42:59,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 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-11-02 20:42:59,703 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-11-02 20:42:59,704 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-11-02 20:42:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:42:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-02 20:42:59,722 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-11-02 20:42:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2022-11-02 20:42:59,724 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 101 [2022-11-02 20:42:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:59,725 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2022-11-02 20:42:59,725 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-11-02 20:42:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2022-11-02 20:42:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:42:59,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:59,729 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-11-02 20:42:59,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:59,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:59,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:42:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash -779099534, now seen corresponding path program 1 times [2022-11-02 20:42:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:59,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424566333] [2022-11-02 20:42:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:00,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424566333] [2022-11-02 20:43:00,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424566333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:00,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473164913] [2022-11-02 20:43:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:00,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:00,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:43:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:00,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:00,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:43:00,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:00,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473164913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:00,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:00,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578355889] [2022-11-02 20:43:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:00,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:00,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:00,520 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-11-02 20:43:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:00,752 INFO L93 Difference]: Finished difference Result 356 states and 529 transitions. [2022-11-02 20:43:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:00,753 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-11-02 20:43:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:00,756 INFO L225 Difference]: With dead ends: 356 [2022-11-02 20:43:00,756 INFO L226 Difference]: Without dead ends: 248 [2022-11-02 20:43:00,757 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-11-02 20:43:00,758 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 240 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:00,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 424 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-02 20:43:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2022-11-02 20:43:00,827 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-11-02 20:43:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2022-11-02 20:43:00,830 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 101 [2022-11-02 20:43:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:00,832 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2022-11-02 20:43:00,832 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-11-02 20:43:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2022-11-02 20:43:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:43:00,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:00,848 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-11-02 20:43:00,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:01,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:01,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -213976846, now seen corresponding path program 1 times [2022-11-02 20:43:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:01,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058149884] [2022-11-02 20:43:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:01,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058149884] [2022-11-02 20:43:01,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058149884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:01,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241703590] [2022-11-02 20:43:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:01,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:01,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:01,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:43:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:01,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:43:01,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:01,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241703590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:01,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:01,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:01,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239020021] [2022-11-02 20:43:01,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:01,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:01,575 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-11-02 20:43:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:01,808 INFO L93 Difference]: Finished difference Result 705 states and 1058 transitions. [2022-11-02 20:43:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:01,809 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-11-02 20:43:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:01,812 INFO L225 Difference]: With dead ends: 705 [2022-11-02 20:43:01,812 INFO L226 Difference]: Without dead ends: 485 [2022-11-02 20:43:01,814 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-11-02 20:43:01,815 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 237 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:01,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 412 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-02 20:43:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-11-02 20:43:01,878 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-11-02 20:43:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 700 transitions. [2022-11-02 20:43:01,882 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 700 transitions. Word has length 101 [2022-11-02 20:43:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:01,882 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 700 transitions. [2022-11-02 20:43:01,883 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-11-02 20:43:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 700 transitions. [2022-11-02 20:43:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:43:01,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:01,886 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-11-02 20:43:01,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:02,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:02,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2077246898, now seen corresponding path program 1 times [2022-11-02 20:43:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:02,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128630628] [2022-11-02 20:43:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:02,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:02,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128630628] [2022-11-02 20:43:02,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128630628] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:02,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489717315] [2022-11-02 20:43:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:02,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:02,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:02,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:02,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:43:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:02,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:43:02,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489717315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:02,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:02,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068174595] [2022-11-02 20:43:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:02,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:02,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:02,544 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-11-02 20:43:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:02,878 INFO L93 Difference]: Finished difference Result 1557 states and 2395 transitions. [2022-11-02 20:43:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:02,879 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-11-02 20:43:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:02,898 INFO L225 Difference]: With dead ends: 1557 [2022-11-02 20:43:02,900 INFO L226 Difference]: Without dead ends: 1109 [2022-11-02 20:43:02,901 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-11-02 20:43:02,904 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 250 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:02,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 452 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-02 20:43:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2022-11-02 20:43:03,049 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-11-02 20:43:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1550 transitions. [2022-11-02 20:43:03,058 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1550 transitions. Word has length 101 [2022-11-02 20:43:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:03,062 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1550 transitions. [2022-11-02 20:43:03,063 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-11-02 20:43:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1550 transitions. [2022-11-02 20:43:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:43:03,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:03,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-11-02 20:43:03,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:03,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash -300696526, now seen corresponding path program 1 times [2022-11-02 20:43:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:03,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511558522] [2022-11-02 20:43:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511558522] [2022-11-02 20:43:03,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511558522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546605481] [2022-11-02 20:43:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:03,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:03,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:03,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:03,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:43:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:03,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:43:03,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:03,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546605481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:03,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:03,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985462597] [2022-11-02 20:43:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:03,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:03,722 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-11-02 20:43:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:04,209 INFO L93 Difference]: Finished difference Result 3377 states and 5343 transitions. [2022-11-02 20:43:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:04,210 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-11-02 20:43:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:04,224 INFO L225 Difference]: With dead ends: 3377 [2022-11-02 20:43:04,224 INFO L226 Difference]: Without dead ends: 2393 [2022-11-02 20:43:04,231 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-11-02 20:43:04,233 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 245 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:04,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 438 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-11-02 20:43:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2261. [2022-11-02 20:43:04,537 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-11-02 20:43:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3538 transitions. [2022-11-02 20:43:04,555 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3538 transitions. Word has length 101 [2022-11-02 20:43:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:04,555 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3538 transitions. [2022-11-02 20:43:04,555 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-11-02 20:43:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3538 transitions. [2022-11-02 20:43:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:43:04,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:04,568 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-11-02 20:43:04,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:04,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:04,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 38237618, now seen corresponding path program 1 times [2022-11-02 20:43:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:04,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073187289] [2022-11-02 20:43:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:04,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073187289] [2022-11-02 20:43:04,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073187289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:04,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137850647] [2022-11-02 20:43:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:04,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:04,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:04,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:43:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:05,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:05,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:05,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:05,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137850647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:05,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:05,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-02 20:43:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198161604] [2022-11-02 20:43:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:05,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:43:05,158 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-11-02 20:43:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:05,410 INFO L93 Difference]: Finished difference Result 4789 states and 7470 transitions. [2022-11-02 20:43:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:05,411 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-11-02 20:43:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:05,426 INFO L225 Difference]: With dead ends: 4789 [2022-11-02 20:43:05,426 INFO L226 Difference]: Without dead ends: 2629 [2022-11-02 20:43:05,434 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-11-02 20:43:05,435 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-11-02 20:43:05,435 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-11-02 20:43:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-11-02 20:43:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2341. [2022-11-02 20:43:05,681 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-11-02 20:43:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3634 transitions. [2022-11-02 20:43:05,724 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3634 transitions. Word has length 101 [2022-11-02 20:43:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:05,724 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3634 transitions. [2022-11-02 20:43:05,725 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-11-02 20:43:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3634 transitions. [2022-11-02 20:43:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:43:05,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:05,741 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-11-02 20:43:05,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:05,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:05,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1425023028, now seen corresponding path program 1 times [2022-11-02 20:43:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:05,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439608017] [2022-11-02 20:43:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:06,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:06,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439608017] [2022-11-02 20:43:06,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439608017] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:06,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459958067] [2022-11-02 20:43:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:06,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:06,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:06,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:06,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:43:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:06,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:06,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:43:06,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:06,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459958067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:06,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:06,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-02 20:43:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068253579] [2022-11-02 20:43:06,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:06,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:06,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:06,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:06,350 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-11-02 20:43:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:06,609 INFO L93 Difference]: Finished difference Result 5110 states and 7919 transitions. [2022-11-02 20:43:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:06,609 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-11-02 20:43:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:06,631 INFO L225 Difference]: With dead ends: 5110 [2022-11-02 20:43:06,632 INFO L226 Difference]: Without dead ends: 2870 [2022-11-02 20:43:06,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 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-11-02 20:43:06,639 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-11-02 20:43:06,639 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-11-02 20:43:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2022-11-02 20:43:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2578. [2022-11-02 20:43:06,897 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-11-02 20:43:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3967 transitions. [2022-11-02 20:43:06,911 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3967 transitions. Word has length 101 [2022-11-02 20:43:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:06,912 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3967 transitions. [2022-11-02 20:43:06,912 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-11-02 20:43:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3967 transitions. [2022-11-02 20:43:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:43:06,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:06,927 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-11-02 20:43:06,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-02 20:43:07,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:43:07,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 457672374, now seen corresponding path program 1 times [2022-11-02 20:43:07,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:07,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846107421] [2022-11-02 20:43:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:43:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:43:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:43:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:43:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:07,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846107421] [2022-11-02 20:43:07,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846107421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:07,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093469253] [2022-11-02 20:43:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:07,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:07,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:07,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:43:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:07,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:43:07,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:43:07,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:07,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093469253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:07,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:07,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918786068] [2022-11-02 20:43:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:07,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:07,498 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-11-02 20:43:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:07,745 INFO L93 Difference]: Finished difference Result 5010 states and 7692 transitions. [2022-11-02 20:43:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:07,746 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-11-02 20:43:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:07,761 INFO L225 Difference]: With dead ends: 5010 [2022-11-02 20:43:07,761 INFO L226 Difference]: Without dead ends: 2658 [2022-11-02 20:43:07,768 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-11-02 20:43:07,771 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-11-02 20:43:07,771 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-11-02 20:43:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-11-02 20:43:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2626. [2022-11-02 20:43:08,085 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-11-02 20:43:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4015 transitions. [2022-11-02 20:43:08,104 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4015 transitions. Word has length 101 [2022-11-02 20:43:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:08,104 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 4015 transitions. [2022-11-02 20:43:08,105 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-11-02 20:43:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4015 transitions. [2022-11-02 20:43:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:43:08,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:08,120 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-11-02 20:43:08,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:08,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:08,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2122057235, now seen corresponding path program 1 times [2022-11-02 20:43:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:08,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720876161] [2022-11-02 20:43:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:43:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:43:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:08,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720876161] [2022-11-02 20:43:08,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720876161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:08,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751231296] [2022-11-02 20:43:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:08,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:08,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:08,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:08,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:43:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:08,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:08,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:43:08,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:08,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751231296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:08,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:08,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-02 20:43:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067389977] [2022-11-02 20:43:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:08,660 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-11-02 20:43:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:08,911 INFO L93 Difference]: Finished difference Result 5324 states and 8539 transitions. [2022-11-02 20:43:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:08,912 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-11-02 20:43:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:08,931 INFO L225 Difference]: With dead ends: 5324 [2022-11-02 20:43:08,931 INFO L226 Difference]: Without dead ends: 2908 [2022-11-02 20:43:08,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 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-11-02 20:43:08,943 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-11-02 20:43:08,945 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-11-02 20:43:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-11-02 20:43:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-11-02 20:43:09,235 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-11-02 20:43:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4555 transitions. [2022-11-02 20:43:09,249 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4555 transitions. Word has length 104 [2022-11-02 20:43:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:09,250 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 4555 transitions. [2022-11-02 20:43:09,250 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-11-02 20:43:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4555 transitions. [2022-11-02 20:43:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:43:09,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:09,265 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-11-02 20:43:09,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-02 20:43:09,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:43:09,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 163482449, now seen corresponding path program 1 times [2022-11-02 20:43:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:09,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609911430] [2022-11-02 20:43:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:43:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:43:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:09,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609911430] [2022-11-02 20:43:09,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609911430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:09,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112811899] [2022-11-02 20:43:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:09,671 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:09,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:43:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:09,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:09,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:09,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:09,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112811899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:09,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:09,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968392065] [2022-11-02 20:43:09,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:09,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:09,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:09,898 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-11-02 20:43:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:10,622 INFO L93 Difference]: Finished difference Result 9208 states and 15036 transitions. [2022-11-02 20:43:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:10,623 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-11-02 20:43:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:10,676 INFO L225 Difference]: With dead ends: 9208 [2022-11-02 20:43:10,677 INFO L226 Difference]: Without dead ends: 6558 [2022-11-02 20:43:10,690 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-11-02 20:43:10,691 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 210 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:10,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 769 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2022-11-02 20:43:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6458. [2022-11-02 20:43:11,384 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-11-02 20:43:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10347 transitions. [2022-11-02 20:43:11,426 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10347 transitions. Word has length 104 [2022-11-02 20:43:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:11,426 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10347 transitions. [2022-11-02 20:43:11,427 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-11-02 20:43:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10347 transitions. [2022-11-02 20:43:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:43:11,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:11,466 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-11-02 20:43:11,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:11,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:11,691 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1052671277, now seen corresponding path program 1 times [2022-11-02 20:43:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183213058] [2022-11-02 20:43:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:43:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:43:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:43:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183213058] [2022-11-02 20:43:11,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183213058] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639949036] [2022-11-02 20:43:11,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:11,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:11,863 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:11,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:43:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:12,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:43:12,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:12,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639949036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:12,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:12,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-11-02 20:43:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008246338] [2022-11-02 20:43:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:12,081 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-11-02 20:43:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:12,804 INFO L93 Difference]: Finished difference Result 14114 states and 22261 transitions. [2022-11-02 20:43:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:12,805 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-11-02 20:43:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:12,870 INFO L225 Difference]: With dead ends: 14114 [2022-11-02 20:43:12,870 INFO L226 Difference]: Without dead ends: 7922 [2022-11-02 20:43:12,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 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-11-02 20:43:12,892 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 77 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:12,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 411 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-11-02 20:43:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6458. [2022-11-02 20:43:13,809 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-11-02 20:43:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10345 transitions. [2022-11-02 20:43:13,841 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10345 transitions. Word has length 104 [2022-11-02 20:43:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:13,842 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10345 transitions. [2022-11-02 20:43:13,843 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-11-02 20:43:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10345 transitions. [2022-11-02 20:43:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 20:43:13,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:13,890 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-11-02 20:43:13,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:14,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:14,115 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash -611500932, now seen corresponding path program 1 times [2022-11-02 20:43:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:14,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106316746] [2022-11-02 20:43:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:43:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:43:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:43:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:43:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:43:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:43:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,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-11-02 20:43:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:14,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106316746] [2022-11-02 20:43:14,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106316746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:14,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238031556] [2022-11-02 20:43:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:14,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:14,271 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:14,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:43:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:14,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:43:14,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:14,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238031556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:14,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:14,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-02 20:43:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800871789] [2022-11-02 20:43:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:14,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:14,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:14,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:14,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:14,415 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-11-02 20:43:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:14,982 INFO L93 Difference]: Finished difference Result 12874 states and 20913 transitions. [2022-11-02 20:43:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:14,983 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-11-02 20:43:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:15,023 INFO L225 Difference]: With dead ends: 12874 [2022-11-02 20:43:15,023 INFO L226 Difference]: Without dead ends: 6894 [2022-11-02 20:43:15,044 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-11-02 20:43:15,045 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-11-02 20:43:15,045 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-11-02 20:43:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2022-11-02 20:43:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6894. [2022-11-02 20:43:15,744 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-11-02 20:43:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11161 transitions. [2022-11-02 20:43:15,775 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11161 transitions. Word has length 107 [2022-11-02 20:43:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:15,777 INFO L495 AbstractCegarLoop]: Abstraction has 6894 states and 11161 transitions. [2022-11-02 20:43:15,777 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-11-02 20:43:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11161 transitions. [2022-11-02 20:43:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 20:43:15,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:15,809 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-11-02 20:43:15,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:16,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:43:16,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1264981886, now seen corresponding path program 1 times [2022-11-02 20:43:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:16,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781871466] [2022-11-02 20:43:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:16,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:43:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:43:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:43:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:43:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:43:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:43:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:16,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781871466] [2022-11-02 20:43:16,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781871466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:16,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422350752] [2022-11-02 20:43:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:16,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:16,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,215 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:43:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:16,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:16,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:16,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:16,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422350752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:16,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:16,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605981748] [2022-11-02 20:43:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:16,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:16,502 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-11-02 20:43:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:17,239 INFO L93 Difference]: Finished difference Result 13370 states and 21103 transitions. [2022-11-02 20:43:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:17,240 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-11-02 20:43:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:17,274 INFO L225 Difference]: With dead ends: 13370 [2022-11-02 20:43:17,274 INFO L226 Difference]: Without dead ends: 7018 [2022-11-02 20:43:17,295 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-11-02 20:43:17,296 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 198 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:17,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 739 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2022-11-02 20:43:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 7014. [2022-11-02 20:43:18,209 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-11-02 20:43:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 10881 transitions. [2022-11-02 20:43:18,248 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 10881 transitions. Word has length 107 [2022-11-02 20:43:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:18,249 INFO L495 AbstractCegarLoop]: Abstraction has 7014 states and 10881 transitions. [2022-11-02 20:43:18,249 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-11-02 20:43:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 10881 transitions. [2022-11-02 20:43:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 20:43:18,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:18,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:43:18,511 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -549218888, now seen corresponding path program 2 times [2022-11-02 20:43:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985150423] [2022-11-02 20:43:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:43:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:43:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:43:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:43:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:43:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:43:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985150423] [2022-11-02 20:43:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985150423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805716887] [2022-11-02 20:43:18,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:18,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:18,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:18,690 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:18,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:43:18,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:43:18,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:18,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:18,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:43:18,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:18,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805716887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:18,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:18,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278123994] [2022-11-02 20:43:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:18,839 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-11-02 20:43:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:19,583 INFO L93 Difference]: Finished difference Result 10122 states and 18596 transitions. [2022-11-02 20:43:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:19,584 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-11-02 20:43:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:19,647 INFO L225 Difference]: With dead ends: 10122 [2022-11-02 20:43:19,647 INFO L226 Difference]: Without dead ends: 10118 [2022-11-02 20:43:19,655 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-11-02 20:43:19,656 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-11-02 20:43:19,656 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-11-02 20:43:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2022-11-02 20:43:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 7206. [2022-11-02 20:43:20,621 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-11-02 20:43:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 11073 transitions. [2022-11-02 20:43:20,647 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 11073 transitions. Word has length 107 [2022-11-02 20:43:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:20,648 INFO L495 AbstractCegarLoop]: Abstraction has 7206 states and 11073 transitions. [2022-11-02 20:43:20,648 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-11-02 20:43:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 11073 transitions. [2022-11-02 20:43:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 20:43:20,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:20,674 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-11-02 20:43:20,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:43:20,891 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1225788474, now seen corresponding path program 1 times [2022-11-02 20:43:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:20,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927278473] [2022-11-02 20:43:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:43:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:43:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:43:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:43:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:43:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:43:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:21,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927278473] [2022-11-02 20:43:21,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927278473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:21,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438991169] [2022-11-02 20:43:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:21,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:21,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,036 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:43:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:21,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:21,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:21,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438991169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:21,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:21,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-02 20:43:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4193190] [2022-11-02 20:43:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:21,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:21,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:43:21,211 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-11-02 20:43:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:21,759 INFO L93 Difference]: Finished difference Result 14926 states and 24105 transitions. [2022-11-02 20:43:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:21,760 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-11-02 20:43:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:21,804 INFO L225 Difference]: With dead ends: 14926 [2022-11-02 20:43:21,804 INFO L226 Difference]: Without dead ends: 8278 [2022-11-02 20:43:21,824 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-11-02 20:43:21,825 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-11-02 20:43:21,825 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-11-02 20:43:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2022-11-02 20:43:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7110. [2022-11-02 20:43:22,599 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-11-02 20:43:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10913 transitions. [2022-11-02 20:43:22,631 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10913 transitions. Word has length 107 [2022-11-02 20:43:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:22,631 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10913 transitions. [2022-11-02 20:43:22,632 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-11-02 20:43:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10913 transitions. [2022-11-02 20:43:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 20:43:22,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:22,664 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-11-02 20:43:22,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:22,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:43:22,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1916204999, now seen corresponding path program 1 times [2022-11-02 20:43:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:22,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447111825] [2022-11-02 20:43:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:43:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:43:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:43:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:43:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:43:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:43:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:43:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:43:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447111825] [2022-11-02 20:43:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447111825] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988230157] [2022-11-02 20:43:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:23,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:23,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:43:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:23,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:43:23,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:23,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988230157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:23,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:23,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-11-02 20:43:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972525606] [2022-11-02 20:43:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:23,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:23,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:23,207 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-11-02 20:43:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:24,236 INFO L93 Difference]: Finished difference Result 15142 states and 23023 transitions. [2022-11-02 20:43:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:24,237 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-11-02 20:43:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:24,273 INFO L225 Difference]: With dead ends: 15142 [2022-11-02 20:43:24,273 INFO L226 Difference]: Without dead ends: 8334 [2022-11-02 20:43:24,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 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-11-02 20:43:24,296 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 79 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:24,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 393 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2022-11-02 20:43:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7110. [2022-11-02 20:43:25,426 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-11-02 20:43:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10909 transitions. [2022-11-02 20:43:25,463 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10909 transitions. Word has length 110 [2022-11-02 20:43:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:25,463 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10909 transitions. [2022-11-02 20:43:25,464 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-11-02 20:43:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10909 transitions. [2022-11-02 20:43:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:43:25,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:25,498 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-11-02 20:43:25,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:25,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:25,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash -406385611, now seen corresponding path program 1 times [2022-11-02 20:43:25,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:25,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087353299] [2022-11-02 20:43:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:43:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:43:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:43:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:43:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:43:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:25,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087353299] [2022-11-02 20:43:25,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087353299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:25,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829146265] [2022-11-02 20:43:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:25,908 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:25,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:43:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:26,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:26,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:43:26,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:26,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829146265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:26,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:26,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-11-02 20:43:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935486237] [2022-11-02 20:43:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:26,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:26,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:26,051 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-11-02 20:43:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:26,608 INFO L93 Difference]: Finished difference Result 14358 states and 22185 transitions. [2022-11-02 20:43:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:26,608 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-11-02 20:43:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:26,638 INFO L225 Difference]: With dead ends: 14358 [2022-11-02 20:43:26,638 INFO L226 Difference]: Without dead ends: 7774 [2022-11-02 20:43:26,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 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-11-02 20:43:26,656 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-11-02 20:43:26,657 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-11-02 20:43:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2022-11-02 20:43:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7774. [2022-11-02 20:43:27,451 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-11-02 20:43:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12001 transitions. [2022-11-02 20:43:27,482 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12001 transitions. Word has length 113 [2022-11-02 20:43:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:27,482 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 12001 transitions. [2022-11-02 20:43:27,483 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-11-02 20:43:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12001 transitions. [2022-11-02 20:43:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:43:27,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:27,511 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-11-02 20:43:27,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:27,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:43:27,739 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash -992661833, now seen corresponding path program 1 times [2022-11-02 20:43:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:27,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633990355] [2022-11-02 20:43:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:43:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:43:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:43:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:43:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:43:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:27,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633990355] [2022-11-02 20:43:27,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633990355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:27,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579881797] [2022-11-02 20:43:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:27,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:27,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:27,883 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:27,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:43:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:27,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:27,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:28,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:28,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579881797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:28,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:28,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710609510] [2022-11-02 20:43:28,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:28,084 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-11-02 20:43:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:28,959 INFO L93 Difference]: Finished difference Result 15082 states and 22658 transitions. [2022-11-02 20:43:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:28,959 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-11-02 20:43:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:28,987 INFO L225 Difference]: With dead ends: 15082 [2022-11-02 20:43:28,987 INFO L226 Difference]: Without dead ends: 7922 [2022-11-02 20:43:29,003 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-11-02 20:43:29,004 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 194 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:29,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 696 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:43:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-11-02 20:43:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7918. [2022-11-02 20:43:29,805 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-11-02 20:43:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11757 transitions. [2022-11-02 20:43:29,837 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11757 transitions. Word has length 113 [2022-11-02 20:43:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:29,837 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11757 transitions. [2022-11-02 20:43:29,838 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-11-02 20:43:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11757 transitions. [2022-11-02 20:43:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:43:29,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:29,868 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-11-02 20:43:29,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:30,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:30,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -38721675, now seen corresponding path program 1 times [2022-11-02 20:43:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:30,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498031092] [2022-11-02 20:43:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:43:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:43:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:43:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:43:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:43:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:43:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498031092] [2022-11-02 20:43:30,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498031092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:30,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848021469] [2022-11-02 20:43:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,225 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:43:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:30,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:43:30,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:30,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848021469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:30,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:30,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-11-02 20:43:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121235125] [2022-11-02 20:43:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:30,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:30,399 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-11-02 20:43:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:31,289 INFO L93 Difference]: Finished difference Result 16338 states and 24119 transitions. [2022-11-02 20:43:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:31,290 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-11-02 20:43:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:31,313 INFO L225 Difference]: With dead ends: 16338 [2022-11-02 20:43:31,313 INFO L226 Difference]: Without dead ends: 8782 [2022-11-02 20:43:31,325 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-11-02 20:43:31,326 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 81 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:31,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 375 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8782 states. [2022-11-02 20:43:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7918. [2022-11-02 20:43:32,079 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-11-02 20:43:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11749 transitions. [2022-11-02 20:43:32,107 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11749 transitions. Word has length 113 [2022-11-02 20:43:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:32,107 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11749 transitions. [2022-11-02 20:43:32,107 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-11-02 20:43:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11749 transitions. [2022-11-02 20:43:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:43:32,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:32,134 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-11-02 20:43:32,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:32,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:32,356 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1693209122, now seen corresponding path program 1 times [2022-11-02 20:43:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:32,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135526977] [2022-11-02 20:43:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:43:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:43:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:43:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:43:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:43:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:32,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135526977] [2022-11-02 20:43:32,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135526977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:32,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351483815] [2022-11-02 20:43:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:32,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:32,509 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:32,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:43:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:32,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:43:32,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:32,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351483815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:32,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:32,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-02 20:43:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648335807] [2022-11-02 20:43:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:32,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:43:32,657 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-11-02 20:43:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:33,625 INFO L93 Difference]: Finished difference Result 16238 states and 24098 transitions. [2022-11-02 20:43:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:33,626 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-11-02 20:43:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:33,655 INFO L225 Difference]: With dead ends: 16238 [2022-11-02 20:43:33,656 INFO L226 Difference]: Without dead ends: 8918 [2022-11-02 20:43:33,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:43:33,674 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-11-02 20:43:33,674 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-11-02 20:43:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2022-11-02 20:43:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8918. [2022-11-02 20:43:34,558 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-11-02 20:43:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13240 transitions. [2022-11-02 20:43:34,579 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13240 transitions. Word has length 116 [2022-11-02 20:43:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:34,580 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 13240 transitions. [2022-11-02 20:43:34,580 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-11-02 20:43:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13240 transitions. [2022-11-02 20:43:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:43:34,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:34,611 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-11-02 20:43:34,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:34,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:34,835 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash -265365664, now seen corresponding path program 1 times [2022-11-02 20:43:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:34,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886563765] [2022-11-02 20:43:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:43:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:43:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:43:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:43:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:43:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:34,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886563765] [2022-11-02 20:43:34,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886563765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:34,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138783272] [2022-11-02 20:43:34,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:34,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:34,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:34,972 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:34,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 20:43:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:35,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:35,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:35,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:35,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138783272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:35,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:35,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-11-02 20:43:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853565077] [2022-11-02 20:43:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:35,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:35,172 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-11-02 20:43:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:36,093 INFO L93 Difference]: Finished difference Result 17280 states and 24901 transitions. [2022-11-02 20:43:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:36,094 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-11-02 20:43:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:36,130 INFO L225 Difference]: With dead ends: 17280 [2022-11-02 20:43:36,130 INFO L226 Difference]: Without dead ends: 9084 [2022-11-02 20:43:36,152 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-11-02 20:43:36,152 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 190 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:36,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 668 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-11-02 20:43:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9080. [2022-11-02 20:43:36,987 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-11-02 20:43:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 12993 transitions. [2022-11-02 20:43:37,010 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 12993 transitions. Word has length 116 [2022-11-02 20:43:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:37,011 INFO L495 AbstractCegarLoop]: Abstraction has 9080 states and 12993 transitions. [2022-11-02 20:43:37,011 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-11-02 20:43:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 12993 transitions. [2022-11-02 20:43:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:43:37,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:37,032 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-11-02 20:43:37,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-02 20:43:37,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:43:37,233 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1481519390, now seen corresponding path program 1 times [2022-11-02 20:43:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:37,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692453879] [2022-11-02 20:43:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:43:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:43:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:43:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:43:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:43:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692453879] [2022-11-02 20:43:37,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692453879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270029674] [2022-11-02 20:43:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:37,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:37,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:37,387 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:37,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-02 20:43:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:37,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:37,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:43:37,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:37,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270029674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:37,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:37,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-11-02 20:43:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224527819] [2022-11-02 20:43:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:37,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:37,582 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-11-02 20:43:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:38,229 INFO L93 Difference]: Finished difference Result 14370 states and 20213 transitions. [2022-11-02 20:43:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:38,230 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-11-02 20:43:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:38,248 INFO L225 Difference]: With dead ends: 14370 [2022-11-02 20:43:38,248 INFO L226 Difference]: Without dead ends: 5904 [2022-11-02 20:43:38,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:38,261 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 96 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:38,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 463 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:43:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2022-11-02 20:43:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 5808. [2022-11-02 20:43:38,748 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-11-02 20:43:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 8282 transitions. [2022-11-02 20:43:38,762 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 8282 transitions. Word has length 116 [2022-11-02 20:43:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:38,762 INFO L495 AbstractCegarLoop]: Abstraction has 5808 states and 8282 transitions. [2022-11-02 20:43:38,763 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-11-02 20:43:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 8282 transitions. [2022-11-02 20:43:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:43:38,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:38,774 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-11-02 20:43:38,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-02 20:43:38,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:43:38,975 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash -961227544, now seen corresponding path program 1 times [2022-11-02 20:43:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:38,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385785542] [2022-11-02 20:43:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:43:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:43:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:43:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:43:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:43:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:43:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:43:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:39,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385785542] [2022-11-02 20:43:39,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385785542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:39,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369499885] [2022-11-02 20:43:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:39,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:39,127 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:39,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-02 20:43:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:43:39,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:43:39,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:39,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369499885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:39,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:43:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323323436] [2022-11-02 20:43:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:39,401 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-11-02 20:43:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:40,021 INFO L93 Difference]: Finished difference Result 11110 states and 15539 transitions. [2022-11-02 20:43:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:40,022 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-11-02 20:43:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:40,037 INFO L225 Difference]: With dead ends: 11110 [2022-11-02 20:43:40,037 INFO L226 Difference]: Without dead ends: 5496 [2022-11-02 20:43:40,048 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-11-02 20:43:40,049 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-11-02 20:43:40,049 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-11-02 20:43:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2022-11-02 20:43:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5496. [2022-11-02 20:43:40,465 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-11-02 20:43:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 7528 transitions. [2022-11-02 20:43:40,483 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 7528 transitions. Word has length 116 [2022-11-02 20:43:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:40,483 INFO L495 AbstractCegarLoop]: Abstraction has 5496 states and 7528 transitions. [2022-11-02 20:43:40,484 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-11-02 20:43:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 7528 transitions. [2022-11-02 20:43:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-02 20:43:40,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:40,498 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-11-02 20:43:40,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:40,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:40,706 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 230421370, now seen corresponding path program 1 times [2022-11-02 20:43:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:40,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628513307] [2022-11-02 20:43:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:43:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:43:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:43:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:43:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:43:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:40,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628513307] [2022-11-02 20:43:40,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628513307] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189186192] [2022-11-02 20:43:40,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:40,913 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:40,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-02 20:43:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:41,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:43:41,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:41,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:41,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189186192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:41,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:41,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-02 20:43:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404049295] [2022-11-02 20:43:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:41,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:41,055 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-11-02 20:43:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:41,568 INFO L93 Difference]: Finished difference Result 11630 states and 16840 transitions. [2022-11-02 20:43:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:41,569 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-11-02 20:43:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:41,588 INFO L225 Difference]: With dead ends: 11630 [2022-11-02 20:43:41,588 INFO L226 Difference]: Without dead ends: 6436 [2022-11-02 20:43:41,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:41,597 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-11-02 20:43:41,598 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-11-02 20:43:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2022-11-02 20:43:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 5544. [2022-11-02 20:43:42,035 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-11-02 20:43:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7576 transitions. [2022-11-02 20:43:42,047 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7576 transitions. Word has length 131 [2022-11-02 20:43:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:42,047 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7576 transitions. [2022-11-02 20:43:42,048 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-11-02 20:43:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7576 transitions. [2022-11-02 20:43:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 20:43:42,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:42,057 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-11-02 20:43:42,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:42,259 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:42,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876967, now seen corresponding path program 1 times [2022-11-02 20:43:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:42,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978610658] [2022-11-02 20:43:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:43:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:43:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:43:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:43:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-02 20:43:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:42,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978610658] [2022-11-02 20:43:42,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978610658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:42,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978060602] [2022-11-02 20:43:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:42,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:42,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:42,465 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:42,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-02 20:43:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:42,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:42,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:42,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:42,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978060602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:42,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:42,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-02 20:43:42,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947760036] [2022-11-02 20:43:42,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:42,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:42,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:42,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:42,605 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-11-02 20:43:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:43,237 INFO L93 Difference]: Finished difference Result 11662 states and 16808 transitions. [2022-11-02 20:43:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:43,238 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-11-02 20:43:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:43,259 INFO L225 Difference]: With dead ends: 11662 [2022-11-02 20:43:43,259 INFO L226 Difference]: Without dead ends: 6420 [2022-11-02 20:43:43,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:43,269 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-11-02 20:43:43,269 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-11-02 20:43:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2022-11-02 20:43:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5544. [2022-11-02 20:43:43,694 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-11-02 20:43:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7528 transitions. [2022-11-02 20:43:43,706 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7528 transitions. Word has length 132 [2022-11-02 20:43:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:43,706 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7528 transitions. [2022-11-02 20:43:43,706 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-11-02 20:43:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7528 transitions. [2022-11-02 20:43:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 20:43:43,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:43,716 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-11-02 20:43:43,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-02 20:43:43,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:43:43,916 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash 412574584, now seen corresponding path program 1 times [2022-11-02 20:43:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:43,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171447550] [2022-11-02 20:43:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:43:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:43:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:43:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:43:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:43:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-02 20:43:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:44,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171447550] [2022-11-02 20:43:44,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171447550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:44,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319314231] [2022-11-02 20:43:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:44,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:44,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:44,106 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:44,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-02 20:43:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:44,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:44,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:44,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319314231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:44,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:44,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-11-02 20:43:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291519075] [2022-11-02 20:43:44,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:44,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:44,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:44,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:43:44,389 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-11-02 20:43:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:45,141 INFO L93 Difference]: Finished difference Result 10786 states and 14542 transitions. [2022-11-02 20:43:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:45,142 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-11-02 20:43:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:45,156 INFO L225 Difference]: With dead ends: 10786 [2022-11-02 20:43:45,157 INFO L226 Difference]: Without dead ends: 5544 [2022-11-02 20:43:45,166 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-11-02 20:43:45,166 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 325 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:45,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-11-02 20:43:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-11-02 20:43:45,876 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-11-02 20:43:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7512 transitions. [2022-11-02 20:43:45,892 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7512 transitions. Word has length 132 [2022-11-02 20:43:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:45,892 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7512 transitions. [2022-11-02 20:43:45,892 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-11-02 20:43:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7512 transitions. [2022-11-02 20:43:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:43:45,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:45,905 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-11-02 20:43:45,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-02 20:43:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:43:46,106 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash -878588795, now seen corresponding path program 1 times [2022-11-02 20:43:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:46,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892680946] [2022-11-02 20:43:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:43:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:43:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:43:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:43:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:46,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:46,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892680946] [2022-11-02 20:43:46,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892680946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:46,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339231342] [2022-11-02 20:43:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:46,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:46,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:46,391 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:46,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-02 20:43:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:46,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:46,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:46,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339231342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:46,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:46,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:43:46,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534424770] [2022-11-02 20:43:46,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:46,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:46,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:46,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:46,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:46,545 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-11-02 20:43:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:47,230 INFO L93 Difference]: Finished difference Result 11822 states and 16920 transitions. [2022-11-02 20:43:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:47,231 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-11-02 20:43:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:47,251 INFO L225 Difference]: With dead ends: 11822 [2022-11-02 20:43:47,251 INFO L226 Difference]: Without dead ends: 6580 [2022-11-02 20:43:47,260 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-11-02 20:43:47,260 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-11-02 20:43:47,261 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-11-02 20:43:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-11-02 20:43:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5656. [2022-11-02 20:43:47,811 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-11-02 20:43:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7656 transitions. [2022-11-02 20:43:47,824 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7656 transitions. Word has length 133 [2022-11-02 20:43:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:47,824 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7656 transitions. [2022-11-02 20:43:47,824 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-11-02 20:43:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7656 transitions. [2022-11-02 20:43:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:43:47,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:47,836 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-11-02 20:43:47,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-11-02 20:43:48,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:43:48,037 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1371214969, now seen corresponding path program 1 times [2022-11-02 20:43:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:48,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822422868] [2022-11-02 20:43:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:43:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:43:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 20:43:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:43:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822422868] [2022-11-02 20:43:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822422868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090837790] [2022-11-02 20:43:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:48,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:48,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,268 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-02 20:43:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:48,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:48,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:48,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090837790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:48,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:48,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-02 20:43:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690820766] [2022-11-02 20:43:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:48,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:43:48,526 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-11-02 20:43:49,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:49,088 INFO L93 Difference]: Finished difference Result 11010 states and 14798 transitions. [2022-11-02 20:43:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:49,088 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-11-02 20:43:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:49,100 INFO L225 Difference]: With dead ends: 11010 [2022-11-02 20:43:49,100 INFO L226 Difference]: Without dead ends: 5656 [2022-11-02 20:43:49,107 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-11-02 20:43:49,108 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 318 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:49,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-11-02 20:43:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5656. [2022-11-02 20:43:49,544 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-11-02 20:43:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7624 transitions. [2022-11-02 20:43:49,555 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7624 transitions. Word has length 133 [2022-11-02 20:43:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:49,556 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7624 transitions. [2022-11-02 20:43:49,556 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-11-02 20:43:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7624 transitions. [2022-11-02 20:43:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:43:49,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:49,565 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-11-02 20:43:49,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-02 20:43:49,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:43:49,765 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1497129402, now seen corresponding path program 1 times [2022-11-02 20:43:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:49,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590445530] [2022-11-02 20:43:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:43:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:43:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:43:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:43:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:43:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:43:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:49,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590445530] [2022-11-02 20:43:49,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590445530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:49,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372138461] [2022-11-02 20:43:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:49,977 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:49,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-02 20:43:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:43:50,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:43:50,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:50,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372138461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:50,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:43:50,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-02 20:43:50,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490699667] [2022-11-02 20:43:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:50,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:50,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:50,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:43:50,290 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-11-02 20:43:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:50,938 INFO L93 Difference]: Finished difference Result 10898 states and 14606 transitions. [2022-11-02 20:43:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:50,940 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-11-02 20:43:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:50,952 INFO L225 Difference]: With dead ends: 10898 [2022-11-02 20:43:50,952 INFO L226 Difference]: Without dead ends: 5544 [2022-11-02 20:43:50,960 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-11-02 20:43:50,961 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:50,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 144 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:43:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-11-02 20:43:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-11-02 20:43:51,422 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-11-02 20:43:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7464 transitions. [2022-11-02 20:43:51,434 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7464 transitions. Word has length 134 [2022-11-02 20:43:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:51,434 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7464 transitions. [2022-11-02 20:43:51,435 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-11-02 20:43:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7464 transitions. [2022-11-02 20:43:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:43:51,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:51,450 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-11-02 20:43:51,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-02 20:43:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:51,663 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1907659227, now seen corresponding path program 1 times [2022-11-02 20:43:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994838779] [2022-11-02 20:43:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:43:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:43:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:43:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:43:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-02 20:43:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:51,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994838779] [2022-11-02 20:43:51,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994838779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:51,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:51,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:43:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676626400] [2022-11-02 20:43:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:51,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:43:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:51,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:51,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:51,836 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-11-02 20:43:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:53,107 INFO L93 Difference]: Finished difference Result 12062 states and 17168 transitions. [2022-11-02 20:43:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:43:53,107 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-11-02 20:43:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:53,135 INFO L225 Difference]: With dead ends: 12062 [2022-11-02 20:43:53,135 INFO L226 Difference]: Without dead ends: 6820 [2022-11-02 20:43:53,146 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-11-02 20:43:53,147 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 222 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:53,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 395 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:43:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-11-02 20:43:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 5656. [2022-11-02 20:43:53,625 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-11-02 20:43:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7568 transitions. [2022-11-02 20:43:53,636 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7568 transitions. Word has length 135 [2022-11-02 20:43:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:53,637 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7568 transitions. [2022-11-02 20:43:53,637 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-11-02 20:43:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7568 transitions. [2022-11-02 20:43:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:43:53,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:53,647 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-11-02 20:43:53,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:43:53,647 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1853266329, now seen corresponding path program 1 times [2022-11-02 20:43:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125070715] [2022-11-02 20:43:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:43:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:43:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:43:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:43:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:43:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:43:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:53,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125070715] [2022-11-02 20:43:53,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125070715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:53,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:53,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:43:53,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332065737] [2022-11-02 20:43:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:53,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:43:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:53,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:43:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:43:53,798 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-11-02 20:43:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:55,295 INFO L93 Difference]: Finished difference Result 13294 states and 18642 transitions. [2022-11-02 20:43:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:43:55,296 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-11-02 20:43:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:55,317 INFO L225 Difference]: With dead ends: 13294 [2022-11-02 20:43:55,317 INFO L226 Difference]: Without dead ends: 7940 [2022-11-02 20:43:55,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:43:55,328 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 287 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:55,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 492 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:43:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2022-11-02 20:43:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7204. [2022-11-02 20:43:56,013 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-11-02 20:43:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 10192 transitions. [2022-11-02 20:43:56,030 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 10192 transitions. Word has length 135 [2022-11-02 20:43:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:56,030 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 10192 transitions. [2022-11-02 20:43:56,030 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-11-02 20:43:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 10192 transitions. [2022-11-02 20:43:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:43:56,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:56,040 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-11-02 20:43:56,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:43:56,040 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1576268195, now seen corresponding path program 1 times [2022-11-02 20:43:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:56,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743506136] [2022-11-02 20:43:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:43:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:43:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:43:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:43:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:43:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:43:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:43:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:43:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-02 20:43:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743506136] [2022-11-02 20:43:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743506136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:43:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107546145] [2022-11-02 20:43:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:56,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:56,225 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:56,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-02 20:43:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:56,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:43:56,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:43:56,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:43:56,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107546145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:56,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:43:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-11-02 20:43:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905825229] [2022-11-02 20:43:56,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:56,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:43:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:56,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:43:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:43:56,811 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-11-02 20:43:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:59,855 INFO L93 Difference]: Finished difference Result 19309 states and 27520 transitions. [2022-11-02 20:43:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-02 20:43:59,855 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-11-02 20:43:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:59,885 INFO L225 Difference]: With dead ends: 19309 [2022-11-02 20:43:59,885 INFO L226 Difference]: Without dead ends: 12287 [2022-11-02 20:43:59,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 20:43:59,903 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1530 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:59,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 480 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:43:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2022-11-02 20:44:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 11183. [2022-11-02 20:44:00,978 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-11-02 20:44:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 14828 transitions. [2022-11-02 20:44:01,000 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 14828 transitions. Word has length 138 [2022-11-02 20:44:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:01,001 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 14828 transitions. [2022-11-02 20:44:01,001 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-11-02 20:44:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 14828 transitions. [2022-11-02 20:44:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:44:01,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:01,009 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-11-02 20:44:01,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-02 20:44:01,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 20:44:01,209 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 700165149, now seen corresponding path program 1 times [2022-11-02 20:44:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276031870] [2022-11-02 20:44:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:44:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:44:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:44:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:44:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:44:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:44:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:44:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:44:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:44:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:44:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:44:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:01,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276031870] [2022-11-02 20:44:01,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276031870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:44:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352405794] [2022-11-02 20:44:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:01,421 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:01,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-02 20:44:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:01,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:44:01,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:44:01,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:44:01,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352405794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:01,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:44:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-02 20:44:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131023304] [2022-11-02 20:44:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:01,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:44:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:01,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:44:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:44:01,678 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-11-02 20:44:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:02,117 INFO L93 Difference]: Finished difference Result 14412 states and 18889 transitions. [2022-11-02 20:44:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:44:02,117 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-11-02 20:44:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:02,119 INFO L225 Difference]: With dead ends: 14412 [2022-11-02 20:44:02,119 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:44:02,134 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-11-02 20:44:02,134 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:02,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 170 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:44:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:44:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:44:02,135 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-11-02 20:44:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:44:02,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2022-11-02 20:44:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:02,137 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:44:02,137 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-11-02 20:44:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:44:02,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:44:02,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:44:02,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-11-02 20:44:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-02 20:44:02,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:44:27,880 WARN L234 SmtUtils]: Spent 9.53s 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-11-02 20:44:42,981 WARN L234 SmtUtils]: Spent 12.40s 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-11-02 20:44:53,004 WARN L234 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 341 DAG size of output: 155 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 20:45:07,290 WARN L234 SmtUtils]: Spent 7.72s 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-11-02 20:45:16,037 WARN L234 SmtUtils]: Spent 8.73s 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-11-02 20:45:39,867 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-11-02 20:45:39,867 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-11-02 20:45:39,867 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-11-02 20:45:39,867 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-11-02 20:45:39,868 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(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-11-02 20:45:39,868 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-11-02 20:45:39,868 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2022-11-02 20:45:39,868 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-11-02 20:45:39,868 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2022-11-02 20:45:39,869 INFO L895 garLoopResultBuilder]: At program point L130(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-11-02 20:45:39,869 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2022-11-02 20:45:39,869 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-11-02 20:45:39,869 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 264 278) the Hoare annotation is: true [2022-11-02 20:45:39,870 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-11-02 20:45:39,870 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 264 278) no Hoare annotation was computed. [2022-11-02 20:45:39,872 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(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-11-02 20:45:39,873 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2022-11-02 20:45:39,873 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-11-02 20:45:39,873 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2022-11-02 20:45:39,873 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2022-11-02 20:45:39,873 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-11-02 20:45:39,873 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-11-02 20:45:39,874 INFO L895 garLoopResultBuilder]: At program point L205(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-11-02 20:45:39,875 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-11-02 20:45:39,875 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-11-02 20:45:39,875 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-11-02 20:45:39,876 INFO L895 garLoopResultBuilder]: At program point L160(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-11-02 20:45:39,876 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-11-02 20:45:39,876 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-11-02 20:45:39,877 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(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-11-02 20:45:39,877 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2022-11-02 20:45:39,878 INFO L895 garLoopResultBuilder]: At program point L190(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-11-02 20:45:39,879 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-11-02 20:45:39,879 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-11-02 20:45:39,879 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-11-02 20:45:39,880 INFO L895 garLoopResultBuilder]: At program point L145(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-11-02 20:45:39,880 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2022-11-02 20:45:39,880 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-11-02 20:45:39,880 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-11-02 20:45:39,880 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2022-11-02 20:45:39,881 INFO L895 garLoopResultBuilder]: At program point L175(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-11-02 20:45:39,882 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-11-02 20:45:39,882 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-11-02 20:45:39,882 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-11-02 20:45:39,882 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2022-11-02 20:45:39,882 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(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-11-02 20:45:39,882 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-11-02 20:45:39,883 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2022-11-02 20:45:39,883 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-11-02 20:45:39,883 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2022-11-02 20:45:39,883 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-11-02 20:45:39,883 INFO L895 garLoopResultBuilder]: At program point L415(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-11-02 20:45:39,884 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-11-02 20:45:39,884 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2022-11-02 20:45:39,884 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-11-02 20:45:39,884 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-11-02 20:45:39,885 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-11-02 20:45:39,885 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-02 20:45:39,885 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 429 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-11-02 20:45:39,885 INFO L895 garLoopResultBuilder]: At program point L490(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-11-02 20:45:39,886 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-11-02 20:45:39,886 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:45:39,886 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-11-02 20:45:39,886 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:45:39,886 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-11-02 20:45:39,886 INFO L895 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-11-02 20:45:39,886 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-11-02 20:45:39,887 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-11-02 20:45:39,887 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2022-11-02 20:45:39,887 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-11-02 20:45:39,887 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-11-02 20:45:39,888 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-11-02 20:45:39,888 INFO L902 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2022-11-02 20:45:39,888 INFO L895 garLoopResultBuilder]: At program point L311(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-11-02 20:45:39,888 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-11-02 20:45:39,889 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-11-02 20:45:39,889 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-11-02 20:45:39,889 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-11-02 20:45:39,889 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-11-02 20:45:39,890 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-11-02 20:45:39,890 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-11-02 20:45:39,890 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-11-02 20:45:39,891 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-11-02 20:45:39,891 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-11-02 20:45:39,891 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-11-02 20:45:39,891 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-11-02 20:45:39,891 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:45:39,892 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-11-02 20:45:39,892 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-11-02 20:45:39,892 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-11-02 20:45:39,893 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-02 20:45:39,893 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:45:39,893 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-11-02 20:45:39,893 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-11-02 20:45:39,893 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-11-02 20:45:39,894 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-11-02 20:45:39,894 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2022-11-02 20:45:39,894 INFO L895 garLoopResultBuilder]: At program point L455(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-11-02 20:45:39,894 INFO L895 garLoopResultBuilder]: At program point L100(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-11-02 20:45:39,895 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-11-02 20:45:39,895 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-11-02 20:45:39,895 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-11-02 20:45:39,895 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-11-02 20:45:39,899 INFO L444 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-11-02 20:45:39,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:45:40,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:45:40 BoogieIcfgContainer [2022-11-02 20:45:40,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:45:40,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:45:40,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:45:40,104 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:45:40,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:57" (3/4) ... [2022-11-02 20:45:40,108 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:45:40,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-02 20:45:40,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-02 20:45:40,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-02 20:45:40,115 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-02 20:45:40,116 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-02 20:45:40,133 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-02 20:45:40,133 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:45:40,134 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:45:40,135 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:45:40,170 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-11-02 20:45:40,171 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-11-02 20:45:40,173 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-11-02 20:45:40,174 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-11-02 20:45:40,175 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-11-02 20:45:40,177 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-11-02 20:45:40,178 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-11-02 20:45:40,222 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:45:40,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:45:40,224 INFO L158 Benchmark]: Toolchain (without parser) took 164460.23ms. Allocated memory was 96.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 55.6MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-02 20:45:40,224 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:45:40,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.52ms. Allocated memory is still 96.5MB. Free memory was 55.5MB in the beginning and 70.8MB in the end (delta: -15.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:45:40,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.82ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:45:40,225 INFO L158 Benchmark]: Boogie Preprocessor took 44.34ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 67.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:45:40,225 INFO L158 Benchmark]: RCFGBuilder took 744.77ms. Allocated memory is still 96.5MB. Free memory was 66.9MB in the beginning and 49.1MB in the end (delta: 17.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 20:45:40,226 INFO L158 Benchmark]: TraceAbstraction took 162999.84ms. Allocated memory was 96.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 48.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-02 20:45:40,226 INFO L158 Benchmark]: Witness Printer took 119.84ms. Allocated memory is still 3.5GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:45:40,227 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.52ms. Allocated memory is still 96.5MB. Free memory was 55.5MB in the beginning and 70.8MB in the end (delta: -15.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.82ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.34ms. Allocated memory is still 96.5MB. Free memory was 68.7MB in the beginning and 67.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 744.77ms. Allocated memory is still 96.5MB. Free memory was 66.9MB in the beginning and 49.1MB in the end (delta: 17.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 162999.84ms. Allocated memory was 96.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 48.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 119.84ms. Allocated memory is still 3.5GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 6.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: 162.7s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.6s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 97.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6126 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6051 mSDsluCounter, 14443 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8707 mSDsCounter, 840 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4486 IncrementalHoareTripleChecker+Invalid, 5326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 840 mSolverCounterUnsat, 5736 mSDtfsCounter, 4486 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, 4.3s 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: 18.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 14460 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 22312 PreInvPairs, 23589 NumberOfFragments, 24499 HoareAnnotationTreeSize, 22312 FomulaSimplifications, 111471 FormulaSimplificationTreeSizeReduction, 15.8s HoareSimplificationTime, 34 FomulaSimplificationsInter, 864480 FormulaSimplificationTreeSizeReductionInter, 81.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 9.1s 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: 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: 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: 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)) - 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: 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: 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: 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: 429]: 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: 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: 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: 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: 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: 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: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - 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) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:45:40,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cacd868-e5e4-426b-82c4-2290c2a3d857/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE