./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:48:52,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:48:52,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:48:52,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:48:52,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:48:52,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:48:52,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:48:52,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:48:52,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:48:52,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:48:52,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:48:52,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:48:52,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:48:52,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:48:52,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:48:52,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:48:52,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:48:52,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:48:52,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:48:52,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:48:52,385 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:48:52,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:48:52,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:48:52,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:48:52,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:48:52,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:48:52,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:48:52,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:48:52,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:48:52,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:48:52,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:48:52,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:48:52,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:48:52,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:48:52,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:48:52,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:48:52,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:48:52,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:48:52,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:48:52,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:48:52,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:48:52,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:48:52,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:48:52,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:48:52,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:48:52,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:48:52,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:48:52,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:48:52,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:48:52,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:48:52,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:48:52,429 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:48:52,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:48:52,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:48:52,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:48:52,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:48:52,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:48:52,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:48:52,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:48:52,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:48:52,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:48:52,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:48:52,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:48:52,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:48:52,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:48:52,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:48:52,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:48:52,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:48:52,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:48:52,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:48:52,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:48:52,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:48:52,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:48:52,434 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:48:52,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:48:52,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:48:52,435 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-22 17:48:52,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:48:52,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:48:52,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:48:52,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:48:52,652 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:48:52,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-07-22 17:48:52,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd2f4a6f/1ecefb435bcb4bd681b2443a992a4e7c/FLAG95d29e91d [2022-07-22 17:48:53,027 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:48:53,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-07-22 17:48:53,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd2f4a6f/1ecefb435bcb4bd681b2443a992a4e7c/FLAG95d29e91d [2022-07-22 17:48:53,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd2f4a6f/1ecefb435bcb4bd681b2443a992a4e7c [2022-07-22 17:48:53,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:48:53,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:48:53,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:48:53,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:48:53,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:48:53,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5275ea1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53, skipping insertion in model container [2022-07-22 17:48:53,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:48:53,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:48:53,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-07-22 17:48:53,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:48:53,698 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:48:53,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-07-22 17:48:53,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:48:53,772 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:48:53,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53 WrapperNode [2022-07-22 17:48:53,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:48:53,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:48:53,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:48:53,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:48:53,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,822 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2022-07-22 17:48:53,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:48:53,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:48:53,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:48:53,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:48:53,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:48:53,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:48:53,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:48:53,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:48:53,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (1/1) ... [2022-07-22 17:48:53,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:48:53,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:53,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 17:48:53,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 17:48:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:48:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-22 17:48:53,952 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-22 17:48:53,952 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-22 17:48:53,952 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-22 17:48:53,952 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-22 17:48:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-22 17:48:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-22 17:48:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-22 17:48:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:48:53,956 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-22 17:48:53,956 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-22 17:48:53,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:48:53,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:48:54,045 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:48:54,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:48:54,298 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:48:54,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:48:54,305 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 17:48:54,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:48:54 BoogieIcfgContainer [2022-07-22 17:48:54,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:48:54,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:48:54,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:48:54,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:48:54,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:48:53" (1/3) ... [2022-07-22 17:48:54,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7c7b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:48:54, skipping insertion in model container [2022-07-22 17:48:54,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:53" (2/3) ... [2022-07-22 17:48:54,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7c7b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:48:54, skipping insertion in model container [2022-07-22 17:48:54,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:48:54" (3/3) ... [2022-07-22 17:48:54,327 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2022-07-22 17:48:54,337 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:48:54,337 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 17:48:54,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:48:54,398 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5efea94b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@95b277b [2022-07-22 17:48:54,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 17:48:54,403 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-07-22 17:48:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 17:48:54,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:54,414 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-07-22 17:48:54,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash 129401130, now seen corresponding path program 1 times [2022-07-22 17:48:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264985314] [2022-07-22 17:48:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 17:48:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:48:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 17:48:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:48:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:54,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264985314] [2022-07-22 17:48:54,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264985314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:54,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:48:54,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:48:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376371603] [2022-07-22 17:48:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:54,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:48:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:48:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:48:54,775 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-07-22 17:48:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:55,296 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2022-07-22 17:48:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 17:48:55,298 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-07-22 17:48:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:55,305 INFO L225 Difference]: With dead ends: 281 [2022-07-22 17:48:55,306 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 17:48:55,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-07-22 17:48:55,311 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 203 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:48:55,311 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.4s Time] [2022-07-22 17:48:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 17:48:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 117. [2022-07-22 17:48:55,351 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-07-22 17:48:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2022-07-22 17:48:55,353 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 42 [2022-07-22 17:48:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:55,353 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2022-07-22 17:48:55,354 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-07-22 17:48:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2022-07-22 17:48:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:55,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:55,357 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-07-22 17:48:55,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:48:55,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1179475252, now seen corresponding path program 1 times [2022-07-22 17:48:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:55,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451055529] [2022-07-22 17:48:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:55,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:55,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451055529] [2022-07-22 17:48:55,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451055529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:55,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167233785] [2022-07-22 17:48:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:55,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:55,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:55,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:55,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 17:48:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 17:48:55,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:48:55,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:55,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167233785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:55,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:55,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-22 17:48:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866604661] [2022-07-22 17:48:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:55,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:48:55,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:55,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:48:55,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:48:55,646 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-07-22 17:48:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:55,658 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-07-22 17:48:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:48:55,659 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-07-22 17:48:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:55,660 INFO L225 Difference]: With dead ends: 227 [2022-07-22 17:48:55,660 INFO L226 Difference]: Without dead ends: 117 [2022-07-22 17:48:55,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:48:55,662 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-07-22 17:48:55,662 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-07-22 17:48:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-22 17:48:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-22 17:48:55,680 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-07-22 17:48:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2022-07-22 17:48:55,681 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 101 [2022-07-22 17:48:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:55,682 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2022-07-22 17:48:55,682 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-07-22 17:48:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2022-07-22 17:48:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:55,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:55,685 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-07-22 17:48:55,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 17:48:55,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:55,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash -779099534, now seen corresponding path program 1 times [2022-07-22 17:48:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614234037] [2022-07-22 17:48:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:56,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614234037] [2022-07-22 17:48:56,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614234037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:56,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409584630] [2022-07-22 17:48:56,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:56,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:56,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 17:48:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:48:56,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 17:48:56,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:56,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409584630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:56,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:56,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:48:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276837100] [2022-07-22 17:48:56,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:56,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:48:56,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:48:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:48:56,255 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-07-22 17:48:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:56,399 INFO L93 Difference]: Finished difference Result 356 states and 529 transitions. [2022-07-22 17:48:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:48:56,400 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-07-22 17:48:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:56,402 INFO L225 Difference]: With dead ends: 356 [2022-07-22 17:48:56,402 INFO L226 Difference]: Without dead ends: 248 [2022-07-22 17:48:56,410 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-07-22 17:48:56,411 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:48:56,412 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.1s Time] [2022-07-22 17:48:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-22 17:48:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 233. [2022-07-22 17:48:56,431 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-07-22 17:48:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2022-07-22 17:48:56,435 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 101 [2022-07-22 17:48:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:56,436 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2022-07-22 17:48:56,436 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-07-22 17:48:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2022-07-22 17:48:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:56,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:56,442 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-07-22 17:48:56,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 17:48:56,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-22 17:48:56,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash -213976846, now seen corresponding path program 1 times [2022-07-22 17:48:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:56,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108995728] [2022-07-22 17:48:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:56,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108995728] [2022-07-22 17:48:56,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108995728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:56,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172316647] [2022-07-22 17:48:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:56,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:56,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:56,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:56,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 17:48:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:56,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:48:56,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 17:48:56,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:56,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172316647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:56,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:56,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:48:56,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167577149] [2022-07-22 17:48:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:56,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:48:56,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:56,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:48:56,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:48:56,938 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-07-22 17:48:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:57,070 INFO L93 Difference]: Finished difference Result 705 states and 1058 transitions. [2022-07-22 17:48:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:48:57,071 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-07-22 17:48:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:57,073 INFO L225 Difference]: With dead ends: 705 [2022-07-22 17:48:57,073 INFO L226 Difference]: Without dead ends: 485 [2022-07-22 17:48:57,074 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-07-22 17:48:57,074 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-07-22 17:48:57,074 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-07-22 17:48:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-07-22 17:48:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-07-22 17:48:57,127 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-07-22 17:48:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 700 transitions. [2022-07-22 17:48:57,129 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 700 transitions. Word has length 101 [2022-07-22 17:48:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:57,129 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 700 transitions. [2022-07-22 17:48:57,130 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-07-22 17:48:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 700 transitions. [2022-07-22 17:48:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:57,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:57,132 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-07-22 17:48:57,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 17:48:57,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:57,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2077246898, now seen corresponding path program 1 times [2022-07-22 17:48:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239089489] [2022-07-22 17:48:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:57,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239089489] [2022-07-22 17:48:57,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239089489] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:57,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122379494] [2022-07-22 17:48:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:57,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:57,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 17:48:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:57,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:48:57,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 17:48:57,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:57,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122379494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:57,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:57,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:48:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356110615] [2022-07-22 17:48:57,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:57,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:48:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:48:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:48:57,591 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-07-22 17:48:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:57,761 INFO L93 Difference]: Finished difference Result 1557 states and 2395 transitions. [2022-07-22 17:48:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:48:57,762 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-07-22 17:48:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:57,767 INFO L225 Difference]: With dead ends: 1557 [2022-07-22 17:48:57,771 INFO L226 Difference]: Without dead ends: 1109 [2022-07-22 17:48:57,772 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-07-22 17:48:57,774 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-07-22 17:48:57,774 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-07-22 17:48:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-07-22 17:48:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1021. [2022-07-22 17:48:57,830 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-07-22 17:48:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1550 transitions. [2022-07-22 17:48:57,836 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1550 transitions. Word has length 101 [2022-07-22 17:48:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:57,836 INFO L495 AbstractCegarLoop]: Abstraction has 1021 states and 1550 transitions. [2022-07-22 17:48:57,836 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-07-22 17:48:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1550 transitions. [2022-07-22 17:48:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:57,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:57,840 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-07-22 17:48:57,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 17:48:58,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:58,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -300696526, now seen corresponding path program 1 times [2022-07-22 17:48:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991851285] [2022-07-22 17:48:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:58,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:58,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991851285] [2022-07-22 17:48:58,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991851285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:58,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224521304] [2022-07-22 17:48:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:58,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:58,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 17:48:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:48:58,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-22 17:48:58,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:58,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224521304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:58,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:58,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:48:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076853079] [2022-07-22 17:48:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:58,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:48:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:48:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:48:58,353 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-07-22 17:48:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:58,542 INFO L93 Difference]: Finished difference Result 3377 states and 5343 transitions. [2022-07-22 17:48:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:48:58,542 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-07-22 17:48:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:58,551 INFO L225 Difference]: With dead ends: 3377 [2022-07-22 17:48:58,551 INFO L226 Difference]: Without dead ends: 2393 [2022-07-22 17:48:58,554 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-07-22 17:48:58,555 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-07-22 17:48:58,555 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-07-22 17:48:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-07-22 17:48:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2261. [2022-07-22 17:48:58,656 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-07-22 17:48:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3538 transitions. [2022-07-22 17:48:58,665 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3538 transitions. Word has length 101 [2022-07-22 17:48:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:58,666 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3538 transitions. [2022-07-22 17:48:58,666 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-07-22 17:48:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3538 transitions. [2022-07-22 17:48:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:58,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:58,673 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-07-22 17:48:58,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 17:48:58,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:58,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash 38237618, now seen corresponding path program 1 times [2022-07-22 17:48:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:58,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930009560] [2022-07-22 17:48:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930009560] [2022-07-22 17:48:58,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930009560] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444499994] [2022-07-22 17:48:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:58,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:58,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:59,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 17:48:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 17:48:59,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 17:48:59,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:59,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444499994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:59,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:59,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-22 17:48:59,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030961052] [2022-07-22 17:48:59,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:59,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:48:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:59,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:48:59,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:48:59,127 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-07-22 17:48:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:59,237 INFO L93 Difference]: Finished difference Result 4789 states and 7470 transitions. [2022-07-22 17:48:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:48:59,238 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-07-22 17:48:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:59,248 INFO L225 Difference]: With dead ends: 4789 [2022-07-22 17:48:59,248 INFO L226 Difference]: Without dead ends: 2629 [2022-07-22 17:48:59,254 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-07-22 17:48:59,255 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-07-22 17:48:59,255 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-07-22 17:48:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-07-22 17:48:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2341. [2022-07-22 17:48:59,353 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-07-22 17:48:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3634 transitions. [2022-07-22 17:48:59,362 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3634 transitions. Word has length 101 [2022-07-22 17:48:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:59,363 INFO L495 AbstractCegarLoop]: Abstraction has 2341 states and 3634 transitions. [2022-07-22 17:48:59,363 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-07-22 17:48:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3634 transitions. [2022-07-22 17:48:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:48:59,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:59,371 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-07-22 17:48:59,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 17:48:59,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:59,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1425023028, now seen corresponding path program 1 times [2022-07-22 17:48:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:59,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194135010] [2022-07-22 17:48:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:59,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:48:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:48:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:48:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:48:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:48:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:48:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:48:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:48:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:48:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:59,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194135010] [2022-07-22 17:48:59,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194135010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:59,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906739802] [2022-07-22 17:48:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:59,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:59,692 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:48:59,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 17:48:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:59,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:48:59,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 17:48:59,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:48:59,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906739802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:59,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:48:59,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-22 17:48:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370918258] [2022-07-22 17:48:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:59,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:48:59,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:59,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:48:59,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:48:59,801 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-07-22 17:48:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:59,919 INFO L93 Difference]: Finished difference Result 5110 states and 7919 transitions. [2022-07-22 17:48:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:48:59,920 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-07-22 17:48:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:59,929 INFO L225 Difference]: With dead ends: 5110 [2022-07-22 17:48:59,929 INFO L226 Difference]: Without dead ends: 2870 [2022-07-22 17:48:59,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:48:59,934 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-07-22 17:48:59,934 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-07-22 17:48:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2022-07-22 17:49:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2578. [2022-07-22 17:49:00,030 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-07-22 17:49:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3967 transitions. [2022-07-22 17:49:00,036 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3967 transitions. Word has length 101 [2022-07-22 17:49:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:00,037 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 3967 transitions. [2022-07-22 17:49:00,037 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-07-22 17:49:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3967 transitions. [2022-07-22 17:49:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 17:49:00,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:00,043 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-07-22 17:49:00,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-22 17:49:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:00,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 457672374, now seen corresponding path program 1 times [2022-07-22 17:49:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:00,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354240917] [2022-07-22 17:49:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:49:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:49:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 17:49:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:49:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 17:49:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 17:49:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:49:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:00,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354240917] [2022-07-22 17:49:00,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354240917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:00,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945780215] [2022-07-22 17:49:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:00,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:00,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:00,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 17:49:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:00,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 17:49:00,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:49:00,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945780215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:00,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:00,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:49:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597977774] [2022-07-22 17:49:00,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:00,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:00,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:00,527 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-07-22 17:49:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:00,647 INFO L93 Difference]: Finished difference Result 5010 states and 7692 transitions. [2022-07-22 17:49:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 17:49:00,647 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-07-22 17:49:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:00,656 INFO L225 Difference]: With dead ends: 5010 [2022-07-22 17:49:00,656 INFO L226 Difference]: Without dead ends: 2658 [2022-07-22 17:49:00,661 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-07-22 17:49:00,663 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-07-22 17:49:00,663 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-07-22 17:49:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-07-22 17:49:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2626. [2022-07-22 17:49:00,776 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-07-22 17:49:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4015 transitions. [2022-07-22 17:49:00,783 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4015 transitions. Word has length 101 [2022-07-22 17:49:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:00,784 INFO L495 AbstractCegarLoop]: Abstraction has 2626 states and 4015 transitions. [2022-07-22 17:49:00,784 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-07-22 17:49:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4015 transitions. [2022-07-22 17:49:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-22 17:49:00,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:00,790 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-07-22 17:49:00,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:01,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-22 17:49:01,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2122057235, now seen corresponding path program 1 times [2022-07-22 17:49:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:01,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457170418] [2022-07-22 17:49:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:49:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:49:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 17:49:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 17:49:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 17:49:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:01,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457170418] [2022-07-22 17:49:01,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457170418] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726310014] [2022-07-22 17:49:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:01,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:01,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:01,082 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:01,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 17:49:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:01,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:49:01,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726310014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:01,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-22 17:49:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608258211] [2022-07-22 17:49:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:01,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:01,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:01,168 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-07-22 17:49:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:01,285 INFO L93 Difference]: Finished difference Result 5324 states and 8539 transitions. [2022-07-22 17:49:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:01,285 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-07-22 17:49:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:01,297 INFO L225 Difference]: With dead ends: 5324 [2022-07-22 17:49:01,298 INFO L226 Difference]: Without dead ends: 2908 [2022-07-22 17:49:01,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:01,305 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-07-22 17:49:01,306 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-07-22 17:49:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-07-22 17:49:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-07-22 17:49:01,433 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-07-22 17:49:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4555 transitions. [2022-07-22 17:49:01,441 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4555 transitions. Word has length 104 [2022-07-22 17:49:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:01,441 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 4555 transitions. [2022-07-22 17:49:01,441 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-07-22 17:49:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4555 transitions. [2022-07-22 17:49:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-22 17:49:01,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:01,449 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-07-22 17:49:01,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:01,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 17:49:01,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 163482449, now seen corresponding path program 1 times [2022-07-22 17:49:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:01,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184536061] [2022-07-22 17:49:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:01,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:49:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:49:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 17:49:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 17:49:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 17:49:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:01,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:01,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184536061] [2022-07-22 17:49:01,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184536061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443124552] [2022-07-22 17:49:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:01,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:01,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:01,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 17:49:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:01,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:49:01,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:01,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:01,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443124552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:01,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:01,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:49:01,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663338256] [2022-07-22 17:49:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:01,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:01,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:01,876 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-07-22 17:49:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:02,179 INFO L93 Difference]: Finished difference Result 9208 states and 15036 transitions. [2022-07-22 17:49:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:49:02,180 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-07-22 17:49:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:02,202 INFO L225 Difference]: With dead ends: 9208 [2022-07-22 17:49:02,203 INFO L226 Difference]: Without dead ends: 6558 [2022-07-22 17:49:02,209 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-07-22 17:49:02,210 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:02,210 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.1s Time] [2022-07-22 17:49:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2022-07-22 17:49:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6458. [2022-07-22 17:49:02,544 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-07-22 17:49:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10347 transitions. [2022-07-22 17:49:02,594 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10347 transitions. Word has length 104 [2022-07-22 17:49:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:02,594 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10347 transitions. [2022-07-22 17:49:02,594 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-07-22 17:49:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10347 transitions. [2022-07-22 17:49:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-22 17:49:02,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:02,681 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-07-22 17:49:02,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:02,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-22 17:49:02,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1052671277, now seen corresponding path program 1 times [2022-07-22 17:49:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:02,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244206998] [2022-07-22 17:49:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:02,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 17:49:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:49:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 17:49:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 17:49:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 17:49:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:02,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244206998] [2022-07-22 17:49:02,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244206998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:02,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943242402] [2022-07-22 17:49:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:02,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:02,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 17:49:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:03,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:49:03,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:49:03,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:03,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943242402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:03,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:03,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-07-22 17:49:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180621867] [2022-07-22 17:49:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:03,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:03,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:03,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:03,097 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-07-22 17:49:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:03,416 INFO L93 Difference]: Finished difference Result 14114 states and 22261 transitions. [2022-07-22 17:49:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:49:03,417 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-07-22 17:49:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:03,461 INFO L225 Difference]: With dead ends: 14114 [2022-07-22 17:49:03,462 INFO L226 Difference]: Without dead ends: 7922 [2022-07-22 17:49:03,478 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-07-22 17:49:03,479 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-07-22 17:49:03,479 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-07-22 17:49:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-07-22 17:49:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 6458. [2022-07-22 17:49:03,788 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-07-22 17:49:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 10345 transitions. [2022-07-22 17:49:03,806 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 10345 transitions. Word has length 104 [2022-07-22 17:49:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:03,807 INFO L495 AbstractCegarLoop]: Abstraction has 6458 states and 10345 transitions. [2022-07-22 17:49:03,808 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-07-22 17:49:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 10345 transitions. [2022-07-22 17:49:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 17:49:03,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:03,840 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-07-22 17:49:03,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:04,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 17:49:04,057 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash -611500932, now seen corresponding path program 1 times [2022-07-22 17:49:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461589055] [2022-07-22 17:49:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:49:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:49:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 17:49:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 17:49:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:49:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:49:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 17:49:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:04,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461589055] [2022-07-22 17:49:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461589055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918627834] [2022-07-22 17:49:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:04,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:04,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:04,135 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:04,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 17:49:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:04,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:04,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:49:04,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:04,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918627834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:04,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:04,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-22 17:49:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007749124] [2022-07-22 17:49:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:04,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:04,219 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-07-22 17:49:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:04,498 INFO L93 Difference]: Finished difference Result 12874 states and 20913 transitions. [2022-07-22 17:49:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:04,499 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-07-22 17:49:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:04,522 INFO L225 Difference]: With dead ends: 12874 [2022-07-22 17:49:04,522 INFO L226 Difference]: Without dead ends: 6894 [2022-07-22 17:49:04,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:04,541 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-07-22 17:49:04,541 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-07-22 17:49:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6894 states. [2022-07-22 17:49:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6894. [2022-07-22 17:49:04,880 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-07-22 17:49:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 11161 transitions. [2022-07-22 17:49:04,898 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 11161 transitions. Word has length 107 [2022-07-22 17:49:04,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:04,899 INFO L495 AbstractCegarLoop]: Abstraction has 6894 states and 11161 transitions. [2022-07-22 17:49:04,899 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-07-22 17:49:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 11161 transitions. [2022-07-22 17:49:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 17:49:04,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:04,926 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-07-22 17:49:04,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:05,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 17:49:05,146 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1264981886, now seen corresponding path program 1 times [2022-07-22 17:49:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:05,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374665758] [2022-07-22 17:49:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:49:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:49:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 17:49:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 17:49:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:49:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:49:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 17:49:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374665758] [2022-07-22 17:49:05,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374665758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953605003] [2022-07-22 17:49:05,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:05,228 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:05,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 17:49:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:05,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:49:05,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:05,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:05,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953605003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:05,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:05,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:49:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881677930] [2022-07-22 17:49:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:05,357 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-07-22 17:49:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:05,771 INFO L93 Difference]: Finished difference Result 13370 states and 21103 transitions. [2022-07-22 17:49:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:49:05,771 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-07-22 17:49:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:05,794 INFO L225 Difference]: With dead ends: 13370 [2022-07-22 17:49:05,794 INFO L226 Difference]: Without dead ends: 7018 [2022-07-22 17:49:05,810 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-07-22 17:49:05,810 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:05,810 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.1s Time] [2022-07-22 17:49:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7018 states. [2022-07-22 17:49:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7018 to 7014. [2022-07-22 17:49:06,086 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-07-22 17:49:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 10881 transitions. [2022-07-22 17:49:06,107 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 10881 transitions. Word has length 107 [2022-07-22 17:49:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:06,107 INFO L495 AbstractCegarLoop]: Abstraction has 7014 states and 10881 transitions. [2022-07-22 17:49:06,107 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-07-22 17:49:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 10881 transitions. [2022-07-22 17:49:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 17:49:06,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:06,127 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-07-22 17:49:06,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:06,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 17:49:06,354 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -549218888, now seen corresponding path program 2 times [2022-07-22 17:49:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:06,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531054970] [2022-07-22 17:49:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:49:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:49:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 17:49:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 17:49:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:49:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:49:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 17:49:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:06,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:06,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531054970] [2022-07-22 17:49:06,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531054970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:06,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915656124] [2022-07-22 17:49:06,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:49:06,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:06,455 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:06,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 17:49:06,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 17:49:06,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:49:06,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:49:06,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 17:49:06,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:06,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915656124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:06,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:06,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:49:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418903621] [2022-07-22 17:49:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:06,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:06,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:06,583 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-07-22 17:49:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:06,844 INFO L93 Difference]: Finished difference Result 10122 states and 18596 transitions. [2022-07-22 17:49:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:49:06,844 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-07-22 17:49:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:06,881 INFO L225 Difference]: With dead ends: 10122 [2022-07-22 17:49:06,881 INFO L226 Difference]: Without dead ends: 10118 [2022-07-22 17:49:06,888 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-07-22 17:49:06,889 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-07-22 17:49:06,889 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-07-22 17:49:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2022-07-22 17:49:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 7206. [2022-07-22 17:49:07,335 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-07-22 17:49:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7206 states to 7206 states and 11073 transitions. [2022-07-22 17:49:07,355 INFO L78 Accepts]: Start accepts. Automaton has 7206 states and 11073 transitions. Word has length 107 [2022-07-22 17:49:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:07,356 INFO L495 AbstractCegarLoop]: Abstraction has 7206 states and 11073 transitions. [2022-07-22 17:49:07,356 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-07-22 17:49:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 7206 states and 11073 transitions. [2022-07-22 17:49:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 17:49:07,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:07,373 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-07-22 17:49:07,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:07,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:07,587 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1225788474, now seen corresponding path program 1 times [2022-07-22 17:49:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:07,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117552067] [2022-07-22 17:49:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:49:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:49:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 17:49:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 17:49:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:49:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:49:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 17:49:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 17:49:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:07,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117552067] [2022-07-22 17:49:07,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117552067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:07,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612821831] [2022-07-22 17:49:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:07,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:07,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:07,658 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:07,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 17:49:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:07,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 17:49:07,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:49:07,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:07,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612821831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:07,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:07,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-07-22 17:49:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058664047] [2022-07-22 17:49:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 17:49:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:07,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 17:49:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:49:07,776 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-07-22 17:49:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:08,123 INFO L93 Difference]: Finished difference Result 14926 states and 24105 transitions. [2022-07-22 17:49:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:49:08,123 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-07-22 17:49:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:08,154 INFO L225 Difference]: With dead ends: 14926 [2022-07-22 17:49:08,154 INFO L226 Difference]: Without dead ends: 8278 [2022-07-22 17:49:08,170 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-07-22 17:49:08,170 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-07-22 17:49:08,171 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-07-22 17:49:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2022-07-22 17:49:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 7110. [2022-07-22 17:49:08,590 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-07-22 17:49:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10913 transitions. [2022-07-22 17:49:08,606 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10913 transitions. Word has length 107 [2022-07-22 17:49:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:08,607 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10913 transitions. [2022-07-22 17:49:08,607 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-07-22 17:49:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10913 transitions. [2022-07-22 17:49:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-22 17:49:08,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:08,622 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-07-22 17:49:08,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:08,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 17:49:08,839 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1916204999, now seen corresponding path program 1 times [2022-07-22 17:49:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:08,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209997873] [2022-07-22 17:49:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:49:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:49:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 17:49:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 17:49:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 17:49:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:49:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 17:49:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 17:49:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 17:49:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:49:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209997873] [2022-07-22 17:49:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209997873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:08,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512900929] [2022-07-22 17:49:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:08,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:08,925 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:08,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 17:49:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:09,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:49:09,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 17:49:09,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:09,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512900929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:09,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:09,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-07-22 17:49:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800239298] [2022-07-22 17:49:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:09,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:09,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:09,049 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-07-22 17:49:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:09,361 INFO L93 Difference]: Finished difference Result 15142 states and 23023 transitions. [2022-07-22 17:49:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:49:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2022-07-22 17:49:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:09,385 INFO L225 Difference]: With dead ends: 15142 [2022-07-22 17:49:09,386 INFO L226 Difference]: Without dead ends: 8334 [2022-07-22 17:49:09,400 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-07-22 17:49:09,400 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-07-22 17:49:09,401 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-07-22 17:49:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8334 states. [2022-07-22 17:49:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8334 to 7110. [2022-07-22 17:49:09,710 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-07-22 17:49:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 10909 transitions. [2022-07-22 17:49:09,727 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 10909 transitions. Word has length 110 [2022-07-22 17:49:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:09,727 INFO L495 AbstractCegarLoop]: Abstraction has 7110 states and 10909 transitions. [2022-07-22 17:49:09,727 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-07-22 17:49:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 10909 transitions. [2022-07-22 17:49:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-22 17:49:09,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:09,743 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-07-22 17:49:09,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:09,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 17:49:09,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash -406385611, now seen corresponding path program 1 times [2022-07-22 17:49:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:09,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885697510] [2022-07-22 17:49:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:49:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 17:49:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:49:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 17:49:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 17:49:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 17:49:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:49:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:10,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885697510] [2022-07-22 17:49:10,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885697510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:10,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704281942] [2022-07-22 17:49:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:10,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:10,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:10,043 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:10,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 17:49:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:10,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:49:10,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:10,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704281942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:10,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:10,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-22 17:49:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079459611] [2022-07-22 17:49:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:10,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:10,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:10,127 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-07-22 17:49:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:10,403 INFO L93 Difference]: Finished difference Result 14358 states and 22185 transitions. [2022-07-22 17:49:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:10,403 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-07-22 17:49:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:10,423 INFO L225 Difference]: With dead ends: 14358 [2022-07-22 17:49:10,423 INFO L226 Difference]: Without dead ends: 7774 [2022-07-22 17:49:10,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:10,435 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-07-22 17:49:10,435 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-07-22 17:49:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2022-07-22 17:49:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 7774. [2022-07-22 17:49:10,747 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-07-22 17:49:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 12001 transitions. [2022-07-22 17:49:10,766 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 12001 transitions. Word has length 113 [2022-07-22 17:49:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:10,767 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 12001 transitions. [2022-07-22 17:49:10,767 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-07-22 17:49:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 12001 transitions. [2022-07-22 17:49:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-22 17:49:10,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:10,785 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-07-22 17:49:10,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:11,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 17:49:11,002 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash -992661833, now seen corresponding path program 1 times [2022-07-22 17:49:11,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:11,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664400330] [2022-07-22 17:49:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:11,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:49:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 17:49:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:49:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 17:49:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 17:49:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 17:49:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:49:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664400330] [2022-07-22 17:49:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664400330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943441297] [2022-07-22 17:49:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:11,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:11,068 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:11,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 17:49:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:11,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:49:11,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:11,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:11,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943441297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:11,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:11,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:49:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524018008] [2022-07-22 17:49:11,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:11,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:11,189 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-07-22 17:49:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:11,536 INFO L93 Difference]: Finished difference Result 15082 states and 22658 transitions. [2022-07-22 17:49:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:49:11,536 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-07-22 17:49:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:11,640 INFO L225 Difference]: With dead ends: 15082 [2022-07-22 17:49:11,640 INFO L226 Difference]: Without dead ends: 7922 [2022-07-22 17:49:11,648 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-07-22 17:49:11,648 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:11,649 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.1s Time] [2022-07-22 17:49:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-07-22 17:49:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7918. [2022-07-22 17:49:11,964 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-07-22 17:49:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11757 transitions. [2022-07-22 17:49:11,983 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11757 transitions. Word has length 113 [2022-07-22 17:49:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:11,984 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11757 transitions. [2022-07-22 17:49:11,984 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-07-22 17:49:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11757 transitions. [2022-07-22 17:49:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-22 17:49:12,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:12,002 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-07-22 17:49:12,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:12,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:12,211 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -38721675, now seen corresponding path program 1 times [2022-07-22 17:49:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:12,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305744033] [2022-07-22 17:49:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:49:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 17:49:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 17:49:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 17:49:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 17:49:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 17:49:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:49:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:12,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305744033] [2022-07-22 17:49:12,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305744033] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:12,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432874737] [2022-07-22 17:49:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:12,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:12,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:12,304 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:12,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-22 17:49:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:12,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:49:12,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 17:49:12,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:12,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432874737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:12,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:12,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-07-22 17:49:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873133892] [2022-07-22 17:49:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:12,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:12,419 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-07-22 17:49:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:12,780 INFO L93 Difference]: Finished difference Result 16338 states and 24119 transitions. [2022-07-22 17:49:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:49:12,781 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-07-22 17:49:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:12,806 INFO L225 Difference]: With dead ends: 16338 [2022-07-22 17:49:12,806 INFO L226 Difference]: Without dead ends: 8782 [2022-07-22 17:49:12,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:12,825 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-07-22 17:49:12,825 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-07-22 17:49:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8782 states. [2022-07-22 17:49:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7918. [2022-07-22 17:49:13,354 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-07-22 17:49:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7918 states to 7918 states and 11749 transitions. [2022-07-22 17:49:13,378 INFO L78 Accepts]: Start accepts. Automaton has 7918 states and 11749 transitions. Word has length 113 [2022-07-22 17:49:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:13,379 INFO L495 AbstractCegarLoop]: Abstraction has 7918 states and 11749 transitions. [2022-07-22 17:49:13,379 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-07-22 17:49:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7918 states and 11749 transitions. [2022-07-22 17:49:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 17:49:13,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:13,401 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-07-22 17:49:13,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:13,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:13,618 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:13,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1693209122, now seen corresponding path program 1 times [2022-07-22 17:49:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:13,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236225455] [2022-07-22 17:49:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:13,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 17:49:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 17:49:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 17:49:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 17:49:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:49:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:13,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236225455] [2022-07-22 17:49:13,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236225455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:13,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497603942] [2022-07-22 17:49:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:13,704 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:13,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-22 17:49:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:13,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:13,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:49:13,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:13,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497603942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:13,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:13,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 17:49:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566081315] [2022-07-22 17:49:13,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:13,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:13,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:13,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:49:13,829 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-07-22 17:49:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:14,210 INFO L93 Difference]: Finished difference Result 16238 states and 24098 transitions. [2022-07-22 17:49:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:14,210 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-07-22 17:49:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:14,240 INFO L225 Difference]: With dead ends: 16238 [2022-07-22 17:49:14,240 INFO L226 Difference]: Without dead ends: 8918 [2022-07-22 17:49:14,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:49:14,258 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-07-22 17:49:14,258 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-07-22 17:49:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8918 states. [2022-07-22 17:49:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8918 to 8918. [2022-07-22 17:49:14,777 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-07-22 17:49:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13240 transitions. [2022-07-22 17:49:14,805 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13240 transitions. Word has length 116 [2022-07-22 17:49:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:14,805 INFO L495 AbstractCegarLoop]: Abstraction has 8918 states and 13240 transitions. [2022-07-22 17:49:14,805 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-07-22 17:49:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13240 transitions. [2022-07-22 17:49:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 17:49:14,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:14,830 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-07-22 17:49:14,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:15,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-22 17:49:15,047 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash -265365664, now seen corresponding path program 1 times [2022-07-22 17:49:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:15,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141277058] [2022-07-22 17:49:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 17:49:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 17:49:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 17:49:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 17:49:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:49:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141277058] [2022-07-22 17:49:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141277058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125930612] [2022-07-22 17:49:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:15,128 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-22 17:49:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 17:49:15,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:15,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:15,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125930612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:15,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:15,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-22 17:49:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404546487] [2022-07-22 17:49:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:15,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:15,270 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-07-22 17:49:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:15,664 INFO L93 Difference]: Finished difference Result 17280 states and 24901 transitions. [2022-07-22 17:49:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 17:49:15,665 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-07-22 17:49:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:15,686 INFO L225 Difference]: With dead ends: 17280 [2022-07-22 17:49:15,686 INFO L226 Difference]: Without dead ends: 9084 [2022-07-22 17:49:15,700 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-07-22 17:49:15,701 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-07-22 17:49:15,701 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-07-22 17:49:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-07-22 17:49:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9080. [2022-07-22 17:49:16,175 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-07-22 17:49:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 12993 transitions. [2022-07-22 17:49:16,196 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 12993 transitions. Word has length 116 [2022-07-22 17:49:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:16,197 INFO L495 AbstractCegarLoop]: Abstraction has 9080 states and 12993 transitions. [2022-07-22 17:49:16,197 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-07-22 17:49:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 12993 transitions. [2022-07-22 17:49:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 17:49:16,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:16,218 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-07-22 17:49:16,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:16,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-22 17:49:16,428 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1481519390, now seen corresponding path program 1 times [2022-07-22 17:49:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:16,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533237875] [2022-07-22 17:49:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:16,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 17:49:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 17:49:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 17:49:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 17:49:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:49:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:16,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533237875] [2022-07-22 17:49:16,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533237875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:16,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231405448] [2022-07-22 17:49:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:16,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:16,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:16,528 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:16,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-22 17:49:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:16,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 17:49:16,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 17:49:16,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:16,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231405448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:16,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:16,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-07-22 17:49:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086716154] [2022-07-22 17:49:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:16,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 17:49:16,645 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-07-22 17:49:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:16,904 INFO L93 Difference]: Finished difference Result 14370 states and 20213 transitions. [2022-07-22 17:49:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 17:49:16,905 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-07-22 17:49:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:16,917 INFO L225 Difference]: With dead ends: 14370 [2022-07-22 17:49:16,918 INFO L226 Difference]: Without dead ends: 5904 [2022-07-22 17:49:16,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:16,929 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 96 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:16,930 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.0s Time] [2022-07-22 17:49:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2022-07-22 17:49:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 5808. [2022-07-22 17:49:17,270 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-07-22 17:49:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 8282 transitions. [2022-07-22 17:49:17,282 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 8282 transitions. Word has length 116 [2022-07-22 17:49:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:17,282 INFO L495 AbstractCegarLoop]: Abstraction has 5808 states and 8282 transitions. [2022-07-22 17:49:17,282 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-07-22 17:49:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 8282 transitions. [2022-07-22 17:49:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-22 17:49:17,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:17,293 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-07-22 17:49:17,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:17,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:17,509 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -961227544, now seen corresponding path program 1 times [2022-07-22 17:49:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:17,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686541037] [2022-07-22 17:49:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 17:49:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 17:49:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 17:49:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 17:49:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 17:49:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 17:49:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-22 17:49:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686541037] [2022-07-22 17:49:17,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686541037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665193780] [2022-07-22 17:49:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:17,591 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:17,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-22 17:49:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:17,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 17:49:17,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-22 17:49:17,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665193780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:17,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:17,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-22 17:49:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248894039] [2022-07-22 17:49:17,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:17,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:17,756 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-07-22 17:49:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:18,013 INFO L93 Difference]: Finished difference Result 11110 states and 15539 transitions. [2022-07-22 17:49:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:49:18,014 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-07-22 17:49:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:18,024 INFO L225 Difference]: With dead ends: 11110 [2022-07-22 17:49:18,024 INFO L226 Difference]: Without dead ends: 5496 [2022-07-22 17:49:18,032 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-07-22 17:49:18,033 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-07-22 17:49:18,033 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-07-22 17:49:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2022-07-22 17:49:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 5496. [2022-07-22 17:49:18,242 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-07-22 17:49:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 7528 transitions. [2022-07-22 17:49:18,252 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 7528 transitions. Word has length 116 [2022-07-22 17:49:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:18,252 INFO L495 AbstractCegarLoop]: Abstraction has 5496 states and 7528 transitions. [2022-07-22 17:49:18,252 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-07-22 17:49:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 7528 transitions. [2022-07-22 17:49:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-22 17:49:18,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:18,292 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-07-22 17:49:18,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-22 17:49:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:18,492 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 230421370, now seen corresponding path program 1 times [2022-07-22 17:49:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:18,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649571698] [2022-07-22 17:49:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 17:49:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 17:49:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 17:49:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 17:49:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 17:49:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 17:49:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:18,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649571698] [2022-07-22 17:49:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649571698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:18,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116719960] [2022-07-22 17:49:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:18,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:18,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:18,567 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:18,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-22 17:49:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:18,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 17:49:18,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:18,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116719960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:18,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:18,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-22 17:49:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182682563] [2022-07-22 17:49:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:18,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:18,671 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-07-22 17:49:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:18,906 INFO L93 Difference]: Finished difference Result 11630 states and 16840 transitions. [2022-07-22 17:49:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:18,906 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-07-22 17:49:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:18,920 INFO L225 Difference]: With dead ends: 11630 [2022-07-22 17:49:18,920 INFO L226 Difference]: Without dead ends: 6436 [2022-07-22 17:49:18,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:18,928 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-07-22 17:49:18,928 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-07-22 17:49:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6436 states. [2022-07-22 17:49:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6436 to 5544. [2022-07-22 17:49:19,158 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-07-22 17:49:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7576 transitions. [2022-07-22 17:49:19,168 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7576 transitions. Word has length 131 [2022-07-22 17:49:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:19,169 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7576 transitions. [2022-07-22 17:49:19,169 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-07-22 17:49:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7576 transitions. [2022-07-22 17:49:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-22 17:49:19,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:19,178 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-07-22 17:49:19,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:19,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-22 17:49:19,391 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:19,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1879876967, now seen corresponding path program 1 times [2022-07-22 17:49:19,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:19,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049810281] [2022-07-22 17:49:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:49:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 17:49:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 17:49:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 17:49:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 17:49:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:19,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:19,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049810281] [2022-07-22 17:49:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049810281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:19,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967167205] [2022-07-22 17:49:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:19,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:19,479 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:19,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-22 17:49:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:19,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:19,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:19,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:19,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967167205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:19,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:19,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-22 17:49:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872515621] [2022-07-22 17:49:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:19,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:19,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:19,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:19,571 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-07-22 17:49:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:19,808 INFO L93 Difference]: Finished difference Result 11662 states and 16808 transitions. [2022-07-22 17:49:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:19,808 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-07-22 17:49:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:19,826 INFO L225 Difference]: With dead ends: 11662 [2022-07-22 17:49:19,826 INFO L226 Difference]: Without dead ends: 6420 [2022-07-22 17:49:19,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 17:49:19,836 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-07-22 17:49:19,836 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-07-22 17:49:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2022-07-22 17:49:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5544. [2022-07-22 17:49:20,088 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-07-22 17:49:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7528 transitions. [2022-07-22 17:49:20,098 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7528 transitions. Word has length 132 [2022-07-22 17:49:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:20,098 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7528 transitions. [2022-07-22 17:49:20,098 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-07-22 17:49:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7528 transitions. [2022-07-22 17:49:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-22 17:49:20,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:20,107 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-07-22 17:49:20,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-22 17:49:20,323 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash 412574584, now seen corresponding path program 1 times [2022-07-22 17:49:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:20,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752833257] [2022-07-22 17:49:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 17:49:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 17:49:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 17:49:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 17:49:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 17:49:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 17:49:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,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-07-22 17:49:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752833257] [2022-07-22 17:49:20,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752833257] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825370027] [2022-07-22 17:49:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:20,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:20,421 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:20,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-22 17:49:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:20,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:20,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:20,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:20,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825370027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:20,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:20,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-22 17:49:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080639319] [2022-07-22 17:49:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:20,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:49:20,595 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-07-22 17:49:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:20,826 INFO L93 Difference]: Finished difference Result 10786 states and 14542 transitions. [2022-07-22 17:49:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:49:20,827 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-07-22 17:49:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:20,837 INFO L225 Difference]: With dead ends: 10786 [2022-07-22 17:49:20,838 INFO L226 Difference]: Without dead ends: 5544 [2022-07-22 17:49:20,844 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-07-22 17:49:20,845 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-07-22 17:49:20,845 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-07-22 17:49:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-07-22 17:49:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-07-22 17:49:21,135 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-07-22 17:49:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7512 transitions. [2022-07-22 17:49:21,146 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7512 transitions. Word has length 132 [2022-07-22 17:49:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:21,147 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7512 transitions. [2022-07-22 17:49:21,147 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-07-22 17:49:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7512 transitions. [2022-07-22 17:49:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-22 17:49:21,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:21,157 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-07-22 17:49:21,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-07-22 17:49:21,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-22 17:49:21,372 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -878588795, now seen corresponding path program 1 times [2022-07-22 17:49:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:21,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844878612] [2022-07-22 17:49:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 17:49:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 17:49:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 17:49:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 17:49:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 17:49:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 17:49:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:21,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844878612] [2022-07-22 17:49:21,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844878612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111752771] [2022-07-22 17:49:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:21,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:21,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:21,498 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:21,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-22 17:49:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:21,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:21,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:21,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:21,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111752771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:21,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:21,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-22 17:49:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414429250] [2022-07-22 17:49:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:49:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:21,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:49:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-22 17:49:21,587 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-07-22 17:49:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:21,838 INFO L93 Difference]: Finished difference Result 11822 states and 16920 transitions. [2022-07-22 17:49:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:49:21,838 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-07-22 17:49:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:21,853 INFO L225 Difference]: With dead ends: 11822 [2022-07-22 17:49:21,854 INFO L226 Difference]: Without dead ends: 6580 [2022-07-22 17:49:21,861 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-07-22 17:49:21,861 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-07-22 17:49:21,862 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-07-22 17:49:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-07-22 17:49:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5656. [2022-07-22 17:49:22,121 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-07-22 17:49:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7656 transitions. [2022-07-22 17:49:22,131 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7656 transitions. Word has length 133 [2022-07-22 17:49:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:22,131 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7656 transitions. [2022-07-22 17:49:22,131 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-07-22 17:49:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7656 transitions. [2022-07-22 17:49:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-22 17:49:22,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:22,140 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-07-22 17:49:22,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:22,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-22 17:49:22,356 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1371214969, now seen corresponding path program 1 times [2022-07-22 17:49:22,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:22,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837257676] [2022-07-22 17:49:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 17:49:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 17:49:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 17:49:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 17:49:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-22 17:49:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 17:49:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:22,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837257676] [2022-07-22 17:49:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837257676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334614011] [2022-07-22 17:49:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:22,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:22,442 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:22,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-22 17:49:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:22,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:22,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:22,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:22,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334614011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:22,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:22,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-22 17:49:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823961791] [2022-07-22 17:49:22,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:22,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:22,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:22,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:22,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:49:22,605 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-07-22 17:49:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:22,888 INFO L93 Difference]: Finished difference Result 11010 states and 14798 transitions. [2022-07-22 17:49:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:49:22,888 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-07-22 17:49:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:22,904 INFO L225 Difference]: With dead ends: 11010 [2022-07-22 17:49:22,904 INFO L226 Difference]: Without dead ends: 5656 [2022-07-22 17:49:22,910 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-07-22 17:49:22,911 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-07-22 17:49:22,911 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-07-22 17:49:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-07-22 17:49:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5656. [2022-07-22 17:49:23,170 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-07-22 17:49:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7624 transitions. [2022-07-22 17:49:23,180 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7624 transitions. Word has length 133 [2022-07-22 17:49:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:23,180 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7624 transitions. [2022-07-22 17:49:23,180 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-07-22 17:49:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7624 transitions. [2022-07-22 17:49:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 17:49:23,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:23,189 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-07-22 17:49:23,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-22 17:49:23,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-22 17:49:23,405 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1497129402, now seen corresponding path program 1 times [2022-07-22 17:49:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:23,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485903959] [2022-07-22 17:49:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 17:49:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 17:49:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-22 17:49:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 17:49:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 17:49:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 17:49:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:23,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485903959] [2022-07-22 17:49:23,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485903959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:23,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677073532] [2022-07-22 17:49:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:23,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:23,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:23,508 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:23,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-22 17:49:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:23,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:23,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:23,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677073532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:23,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:23,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-22 17:49:23,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967297623] [2022-07-22 17:49:23,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:23,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:49:23,761 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-07-22 17:49:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:24,039 INFO L93 Difference]: Finished difference Result 10898 states and 14606 transitions. [2022-07-22 17:49:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:49:24,039 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-07-22 17:49:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:24,051 INFO L225 Difference]: With dead ends: 10898 [2022-07-22 17:49:24,052 INFO L226 Difference]: Without dead ends: 5544 [2022-07-22 17:49:24,060 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-07-22 17:49:24,060 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-07-22 17:49:24,060 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-07-22 17:49:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2022-07-22 17:49:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2022-07-22 17:49:24,352 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-07-22 17:49:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7464 transitions. [2022-07-22 17:49:24,364 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7464 transitions. Word has length 134 [2022-07-22 17:49:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:24,364 INFO L495 AbstractCegarLoop]: Abstraction has 5544 states and 7464 transitions. [2022-07-22 17:49:24,364 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-07-22 17:49:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7464 transitions. [2022-07-22 17:49:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:49:24,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:24,374 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-07-22 17:49:24,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:24,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:24,586 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1907659227, now seen corresponding path program 1 times [2022-07-22 17:49:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:24,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320111830] [2022-07-22 17:49:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:49:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 17:49:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 17:49:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:49:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 17:49:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:24,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320111830] [2022-07-22 17:49:24,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320111830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:24,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:49:24,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:49:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304315796] [2022-07-22 17:49:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:24,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:49:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:49:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:49:24,680 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-07-22 17:49:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:25,290 INFO L93 Difference]: Finished difference Result 12062 states and 17168 transitions. [2022-07-22 17:49:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:49:25,291 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-07-22 17:49:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:25,311 INFO L225 Difference]: With dead ends: 12062 [2022-07-22 17:49:25,311 INFO L226 Difference]: Without dead ends: 6820 [2022-07-22 17:49:25,322 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-07-22 17:49:25,322 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 222 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:25,322 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.2s Time] [2022-07-22 17:49:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-07-22 17:49:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 5656. [2022-07-22 17:49:25,647 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-07-22 17:49:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 7568 transitions. [2022-07-22 17:49:25,660 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 7568 transitions. Word has length 135 [2022-07-22 17:49:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:25,660 INFO L495 AbstractCegarLoop]: Abstraction has 5656 states and 7568 transitions. [2022-07-22 17:49:25,660 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-07-22 17:49:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 7568 transitions. [2022-07-22 17:49:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 17:49:25,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:25,670 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-07-22 17:49:25,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-22 17:49:25,671 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1853266329, now seen corresponding path program 1 times [2022-07-22 17:49:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:25,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001765775] [2022-07-22 17:49:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:49:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 17:49:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 17:49:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 17:49:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 17:49:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:25,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001765775] [2022-07-22 17:49:25,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001765775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:25,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:49:25,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 17:49:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530029270] [2022-07-22 17:49:25,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:25,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 17:49:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 17:49:25,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 17:49:25,754 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-07-22 17:49:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:26,684 INFO L93 Difference]: Finished difference Result 13294 states and 18642 transitions. [2022-07-22 17:49:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 17:49:26,684 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-07-22 17:49:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:26,701 INFO L225 Difference]: With dead ends: 13294 [2022-07-22 17:49:26,702 INFO L226 Difference]: Without dead ends: 7940 [2022-07-22 17:49:26,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-22 17:49:26,712 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 287 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:26,712 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.3s Time] [2022-07-22 17:49:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2022-07-22 17:49:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7204. [2022-07-22 17:49:27,133 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-07-22 17:49:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 10192 transitions. [2022-07-22 17:49:27,148 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 10192 transitions. Word has length 135 [2022-07-22 17:49:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:27,148 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 10192 transitions. [2022-07-22 17:49:27,148 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-07-22 17:49:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 10192 transitions. [2022-07-22 17:49:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 17:49:27,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:27,156 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-07-22 17:49:27,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-22 17:49:27,157 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1576268195, now seen corresponding path program 1 times [2022-07-22 17:49:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111392903] [2022-07-22 17:49:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:49:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 17:49:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 17:49:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 17:49:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 17:49:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-22 17:49:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111392903] [2022-07-22 17:49:27,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111392903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081153085] [2022-07-22 17:49:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:27,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:27,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:27,230 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:27,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-22 17:49:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:27,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 17:49:27,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:49:27,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:49:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 17:49:27,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081153085] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:49:27,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:49:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2022-07-22 17:49:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55154220] [2022-07-22 17:49:27,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:49:27,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 17:49:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:27,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 17:49:27,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:49:27,581 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-07-22 17:49:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:29,246 INFO L93 Difference]: Finished difference Result 19309 states and 27520 transitions. [2022-07-22 17:49:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-22 17:49:29,247 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-07-22 17:49:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:29,272 INFO L225 Difference]: With dead ends: 19309 [2022-07-22 17:49:29,272 INFO L226 Difference]: Without dead ends: 12287 [2022-07-22 17:49:29,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2022-07-22 17:49:29,289 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1530 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:29,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 480 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 17:49:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2022-07-22 17:49:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 11183. [2022-07-22 17:49:29,942 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-07-22 17:49:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 14828 transitions. [2022-07-22 17:49:29,962 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 14828 transitions. Word has length 138 [2022-07-22 17:49:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:29,963 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 14828 transitions. [2022-07-22 17:49:29,963 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-07-22 17:49:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 14828 transitions. [2022-07-22 17:49:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 17:49:29,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:29,970 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-07-22 17:49:29,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-22 17:49:30,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-22 17:49:30,173 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 700165149, now seen corresponding path program 1 times [2022-07-22 17:49:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:30,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219344608] [2022-07-22 17:49:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 17:49:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 17:49:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 17:49:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 17:49:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 17:49:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 17:49:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 17:49:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 17:49:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 17:49:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:49:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:30,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219344608] [2022-07-22 17:49:30,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219344608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:30,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918396723] [2022-07-22 17:49:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:30,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:30,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:30,298 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 17:49:30,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-22 17:49:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 17:49:30,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:49:30,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 17:49:30,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918396723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:49:30,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 17:49:30,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-22 17:49:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533831546] [2022-07-22 17:49:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:49:30,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 17:49:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 17:49:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:49:30,490 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-07-22 17:49:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:30,725 INFO L93 Difference]: Finished difference Result 14412 states and 18889 transitions. [2022-07-22 17:49:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 17:49:30,726 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-07-22 17:49:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:30,727 INFO L225 Difference]: With dead ends: 14412 [2022-07-22 17:49:30,727 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 17:49:30,741 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-07-22 17:49:30,741 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-07-22 17:49:30,742 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-07-22 17:49:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 17:49:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 17:49:30,742 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-07-22 17:49:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 17:49:30,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2022-07-22 17:49:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:30,743 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 17:49:30,743 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-07-22 17:49:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 17:49:30,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 17:49:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 17:49:30,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-22 17:49:30,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:30,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 17:49:46,486 WARN L233 SmtUtils]: Spent 5.45s 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-07-22 17:49:55,388 WARN L233 SmtUtils]: Spent 7.36s 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-07-22 17:50:25,138 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-07-22 17:50:25,138 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2022-07-22 17:50:25,138 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2022-07-22 17:50:25,138 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2022-07-22 17:50:25,138 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-07-22 17:50:25,139 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2022-07-22 17:50:25,139 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2022-07-22 17:50:25,139 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2022-07-22 17:50:25,139 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2022-07-22 17:50:25,139 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-07-22 17:50:25,139 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2022-07-22 17:50:25,139 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2022-07-22 17:50:25,139 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 264 278) the Hoare annotation is: true [2022-07-22 17:50:25,140 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-07-22 17:50:25,140 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 264 278) no Hoare annotation was computed. [2022-07-22 17:50:25,140 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-07-22 17:50:25,140 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2022-07-22 17:50:25,140 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2022-07-22 17:50:25,140 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2022-07-22 17:50:25,140 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2022-07-22 17:50:25,140 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2022-07-22 17:50:25,141 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2022-07-22 17:50:25,141 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-07-22 17:50:25,141 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2022-07-22 17:50:25,141 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2022-07-22 17:50:25,141 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2022-07-22 17:50:25,142 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-07-22 17:50:25,142 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2022-07-22 17:50:25,142 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2022-07-22 17:50:25,142 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-07-22 17:50:25,142 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2022-07-22 17:50:25,143 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-07-22 17:50:25,143 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2022-07-22 17:50:25,143 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2022-07-22 17:50:25,143 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2022-07-22 17:50:25,143 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-07-22 17:50:25,143 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2022-07-22 17:50:25,143 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2022-07-22 17:50:25,144 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2022-07-22 17:50:25,144 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2022-07-22 17:50:25,144 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-07-22 17:50:25,144 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2022-07-22 17:50:25,144 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-07-22 17:50:25,144 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2022-07-22 17:50:25,144 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2022-07-22 17:50:25,145 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-07-22 17:50:25,145 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2022-07-22 17:50:25,145 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2022-07-22 17:50:25,145 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2022-07-22 17:50:25,145 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2022-07-22 17:50:25,145 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2022-07-22 17:50:25,145 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-07-22 17:50:25,146 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-07-22 17:50:25,146 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2022-07-22 17:50:25,146 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2022-07-22 17:50:25,146 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2022-07-22 17:50:25,146 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2022-07-22 17:50:25,146 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-22 17:50:25,146 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-07-22 17:50:25,154 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-07-22 17:50:25,154 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-07-22 17:50:25,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 17:50:25,154 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2022-07-22 17:50:25,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 17:50:25,154 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-07-22 17:50:25,154 INFO L895 garLoopResultBuilder]: At program point L20(lines 15 22) the Hoare annotation is: false [2022-07-22 17:50:25,155 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-07-22 17:50:25,155 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-07-22 17:50:25,155 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2022-07-22 17:50:25,155 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-07-22 17:50:25,155 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2022-07-22 17:50:25,155 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-07-22 17:50:25,155 INFO L902 garLoopResultBuilder]: At program point L509(lines 493 511) the Hoare annotation is: true [2022-07-22 17:50:25,155 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-07-22 17:50:25,156 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-07-22 17:50:25,156 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2022-07-22 17:50:25,156 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2022-07-22 17:50:25,156 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-07-22 17:50:25,156 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-07-22 17:50:25,156 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-07-22 17:50:25,156 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-07-22 17:50:25,157 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-07-22 17:50:25,157 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-07-22 17:50:25,157 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-07-22 17:50:25,157 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2022-07-22 17:50:25,157 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-07-22 17:50:25,157 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 17:50:25,157 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-07-22 17:50:25,157 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-07-22 17:50:25,158 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-07-22 17:50:25,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-22 17:50:25,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 17:50:25,158 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-07-22 17:50:25,158 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-07-22 17:50:25,158 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2022-07-22 17:50:25,158 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-07-22 17:50:25,158 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2022-07-22 17:50:25,158 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-07-22 17:50:25,159 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-07-22 17:50:25,159 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-07-22 17:50:25,159 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2022-07-22 17:50:25,159 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-07-22 17:50:25,159 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2022-07-22 17:50:25,161 INFO L356 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-07-22 17:50:25,163 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 17:50:25,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 05:50:25 BoogieIcfgContainer [2022-07-22 17:50:25,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 17:50:25,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 17:50:25,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 17:50:25,278 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 17:50:25,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:48:54" (3/4) ... [2022-07-22 17:50:25,280 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 17:50:25,284 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-07-22 17:50:25,284 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-22 17:50:25,284 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-07-22 17:50:25,284 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-07-22 17:50:25,284 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-07-22 17:50:25,294 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-22 17:50:25,294 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 17:50:25,295 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 17:50:25,295 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 17:50:25,312 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-07-22 17:50:25,313 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-07-22 17:50:25,313 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-07-22 17:50:25,314 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-07-22 17:50:25,314 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-07-22 17:50:25,316 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-07-22 17:50:25,316 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-07-22 17:50:25,347 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 17:50:25,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 17:50:25,350 INFO L158 Benchmark]: Toolchain (without parser) took 91908.55ms. Allocated memory was 88.1MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 53.6MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 380.8MB. Max. memory is 16.1GB. [2022-07-22 17:50:25,350 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory was 57.7MB in the beginning and 57.6MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:50:25,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.75ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.4MB in the beginning and 80.1MB in the end (delta: -26.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-22 17:50:25,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 17:50:25,354 INFO L158 Benchmark]: Boogie Preprocessor took 18.66ms. Allocated memory is still 107.0MB. Free memory was 78.0MB in the beginning and 76.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 17:50:25,355 INFO L158 Benchmark]: RCFGBuilder took 464.67ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 60.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 17:50:25,355 INFO L158 Benchmark]: TraceAbstraction took 90969.25ms. Allocated memory was 107.0MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 60.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-07-22 17:50:25,355 INFO L158 Benchmark]: Witness Printer took 69.79ms. Allocated memory is still 3.2GB. Free memory was 2.8GB in the beginning and 2.7GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 17:50:25,356 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.15ms. Allocated memory is still 88.1MB. Free memory was 57.7MB in the beginning and 57.6MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.75ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.4MB in the beginning and 80.1MB in the end (delta: -26.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 107.0MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.66ms. Allocated memory is still 107.0MB. Free memory was 78.0MB in the beginning and 76.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 464.67ms. Allocated memory is still 107.0MB. Free memory was 76.5MB in the beginning and 60.3MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 90969.25ms. Allocated memory was 107.0MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 60.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 69.79ms. Allocated memory is still 3.2GB. Free memory was 2.8GB in the beginning and 2.7GB 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: 90.8s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6126 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6051 mSDsluCounter, 14443 SdHoareTripleChecker+Invalid, 2.2s 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, 4228 SyntacticMatches, 4 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.7s 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: 9.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 14460 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 22312 PreInvPairs, 23589 NumberOfFragments, 24499 HoareAnnotationTreeSize, 22312 FomulaSimplifications, 111471 FormulaSimplificationTreeSizeReduction, 9.9s HoareSimplificationTime, 34 FomulaSimplificationsInter, 864480 FormulaSimplificationTreeSizeReductionInter, 43.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.6s 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-07-22 17:50:25,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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