./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:26:32,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:26:32,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:26:32,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:26:32,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:26:33,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:26:33,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:26:33,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:26:33,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:26:33,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:26:33,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:26:33,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:26:33,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:26:33,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:26:33,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:26:33,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:26:33,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:26:33,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:26:33,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:26:33,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:26:33,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:26:33,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:26:33,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:26:33,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:26:33,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:26:33,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:26:33,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:26:33,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:26:33,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:26:33,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:26:33,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:26:33,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:26:33,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:26:33,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:26:33,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:26:33,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:26:33,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:26:33,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:26:33,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:26:33,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:26:33,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:26:33,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:26:33,100 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:26:33,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:26:33,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:26:33,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:26:33,103 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:26:33,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:26:33,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:26:33,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:26:33,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:26:33,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:26:33,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:26:33,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:26:33,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:26:33,110 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:26:33,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:26:33,110 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:26:33,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:26:33,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:26:33,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:26:33,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:26:33,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:26:33,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:26:33,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:26:33,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:26:33,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:26:33,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:26:33,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:26:33,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:26:33,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2019-11-28 00:26:33,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:26:33,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:26:33,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:26:33,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:26:33,416 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:26:33,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-28 00:26:33,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8726d0a94/8b9c5059b4534baa86c07d2ede7eefe0/FLAG33c95398e [2019-11-28 00:26:33,998 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:26:33,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2019-11-28 00:26:34,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8726d0a94/8b9c5059b4534baa86c07d2ede7eefe0/FLAG33c95398e [2019-11-28 00:26:34,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8726d0a94/8b9c5059b4534baa86c07d2ede7eefe0 [2019-11-28 00:26:34,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:26:34,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:26:34,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:34,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:26:34,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:26:34,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:34,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f305c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34, skipping insertion in model container [2019-11-28 00:26:34,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:34,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:26:34,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:26:34,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:34,768 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:26:34,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:34,951 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:26:34,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34 WrapperNode [2019-11-28 00:26:34,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:34,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:34,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:26:34,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:26:34,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:34,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:35,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:26:35,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:26:35,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:26:35,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... [2019-11-28 00:26:35,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:26:35,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:26:35,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:26:35,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:26:35,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:26:35,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:26:35,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:26:35,730 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:26:35,730 INFO L297 CfgBuilder]: Removed 64 assume(true) statements. [2019-11-28 00:26:35,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:35 BoogieIcfgContainer [2019-11-28 00:26:35,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:26:35,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:26:35,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:26:35,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:26:35,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:26:34" (1/3) ... [2019-11-28 00:26:35,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ef0c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:35, skipping insertion in model container [2019-11-28 00:26:35,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:34" (2/3) ... [2019-11-28 00:26:35,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ef0c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:35, skipping insertion in model container [2019-11-28 00:26:35,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:35" (3/3) ... [2019-11-28 00:26:35,741 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-11-28 00:26:35,752 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:26:35,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:26:35,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:26:35,803 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:26:35,803 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:26:35,803 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:26:35,803 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:26:35,804 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:26:35,804 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:26:35,804 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:26:35,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:26:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-28 00:26:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:26:35,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:35,834 INFO L410 BasicCegarLoop]: 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] [2019-11-28 00:26:35,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-11-28 00:26:35,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:35,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333766181] [2019-11-28 00:26:35,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:36,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333766181] [2019-11-28 00:26:36,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:36,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:36,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951600415] [2019-11-28 00:26:36,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:36,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,056 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-11-28 00:26:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,117 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-11-28 00:26:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:36,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 00:26:36,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,132 INFO L225 Difference]: With dead ends: 210 [2019-11-28 00:26:36,132 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 00:26:36,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 00:26:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 00:26:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 00:26:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-11-28 00:26:36,187 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-11-28 00:26:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,187 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-11-28 00:26:36,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-11-28 00:26:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 00:26:36,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,191 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-11-28 00:26:36,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799783307] [2019-11-28 00:26:36,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:36,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799783307] [2019-11-28 00:26:36,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:36,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:36,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254467392] [2019-11-28 00:26:36,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:36,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,270 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-11-28 00:26:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,320 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-11-28 00:26:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:36,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-28 00:26:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,326 INFO L225 Difference]: With dead ends: 199 [2019-11-28 00:26:36,326 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 00:26:36,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 00:26:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 00:26:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 00:26:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-11-28 00:26:36,342 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-11-28 00:26:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,343 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-11-28 00:26:36,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-11-28 00:26:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 00:26:36,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,348 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-11-28 00:26:36,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9738362] [2019-11-28 00:26:36,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:36,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9738362] [2019-11-28 00:26:36,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:36,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:36,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335724927] [2019-11-28 00:26:36,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:36,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:36,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,442 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-11-28 00:26:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,487 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-11-28 00:26:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:36,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-28 00:26:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,489 INFO L225 Difference]: With dead ends: 196 [2019-11-28 00:26:36,490 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 00:26:36,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 00:26:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 00:26:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 00:26:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-11-28 00:26:36,502 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-11-28 00:26:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-11-28 00:26:36,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-11-28 00:26:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 00:26:36,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,505 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,506 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-11-28 00:26:36,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233430020] [2019-11-28 00:26:36,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:36,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233430020] [2019-11-28 00:26:36,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:36,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:36,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757055287] [2019-11-28 00:26:36,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:36,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,579 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-11-28 00:26:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,617 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-11-28 00:26:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:36,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-28 00:26:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,620 INFO L225 Difference]: With dead ends: 193 [2019-11-28 00:26:36,620 INFO L226 Difference]: Without dead ends: 104 [2019-11-28 00:26:36,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-28 00:26:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-28 00:26:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 00:26:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-11-28 00:26:36,632 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-11-28 00:26:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,632 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-11-28 00:26:36,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-11-28 00:26:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 00:26:36,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,635 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,635 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-11-28 00:26:36,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858020648] [2019-11-28 00:26:36,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:36,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858020648] [2019-11-28 00:26:36,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:36,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:36,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244846672] [2019-11-28 00:26:36,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:36,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,738 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-11-28 00:26:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,785 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-11-28 00:26:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:36,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 00:26:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,788 INFO L225 Difference]: With dead ends: 271 [2019-11-28 00:26:36,788 INFO L226 Difference]: Without dead ends: 191 [2019-11-28 00:26:36,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-28 00:26:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-11-28 00:26:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 00:26:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-11-28 00:26:36,815 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-11-28 00:26:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,816 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-11-28 00:26:36,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-11-28 00:26:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 00:26:36,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,819 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,819 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-11-28 00:26:36,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689049928] [2019-11-28 00:26:36,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:36,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689049928] [2019-11-28 00:26:36,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:36,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:36,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932505218] [2019-11-28 00:26:36,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:36,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,890 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-11-28 00:26:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:36,962 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-11-28 00:26:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:36,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 00:26:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:36,965 INFO L225 Difference]: With dead ends: 536 [2019-11-28 00:26:36,966 INFO L226 Difference]: Without dead ends: 371 [2019-11-28 00:26:36,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-28 00:26:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-11-28 00:26:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-28 00:26:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-11-28 00:26:36,992 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-11-28 00:26:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:36,992 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-11-28 00:26:36,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-11-28 00:26:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 00:26:36,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:36,995 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:36,995 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-11-28 00:26:36,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:36,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691054679] [2019-11-28 00:26:36,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:37,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691054679] [2019-11-28 00:26:37,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:37,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:37,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496932583] [2019-11-28 00:26:37,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:37,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:37,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,051 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-11-28 00:26:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,136 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-11-28 00:26:37,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:37,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-28 00:26:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,139 INFO L225 Difference]: With dead ends: 697 [2019-11-28 00:26:37,140 INFO L226 Difference]: Without dead ends: 408 [2019-11-28 00:26:37,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-28 00:26:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-28 00:26:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-28 00:26:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-11-28 00:26:37,173 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-11-28 00:26:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,174 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-11-28 00:26:37,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-11-28 00:26:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 00:26:37,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,178 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:37,179 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-11-28 00:26:37,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:37,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507006167] [2019-11-28 00:26:37,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:37,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507006167] [2019-11-28 00:26:37,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:37,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:37,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077179318] [2019-11-28 00:26:37,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:37,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:37,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,279 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-11-28 00:26:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,357 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-11-28 00:26:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:37,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 00:26:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,363 INFO L225 Difference]: With dead ends: 1166 [2019-11-28 00:26:37,363 INFO L226 Difference]: Without dead ends: 805 [2019-11-28 00:26:37,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-28 00:26:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-11-28 00:26:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-11-28 00:26:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-11-28 00:26:37,398 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-11-28 00:26:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,398 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-11-28 00:26:37,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-11-28 00:26:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 00:26:37,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,402 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:37,402 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-11-28 00:26:37,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:37,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699075923] [2019-11-28 00:26:37,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:37,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699075923] [2019-11-28 00:26:37,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:37,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:37,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080266348] [2019-11-28 00:26:37,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:37,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,445 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-11-28 00:26:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,511 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-11-28 00:26:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:37,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 00:26:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,517 INFO L225 Difference]: With dead ends: 1533 [2019-11-28 00:26:37,517 INFO L226 Difference]: Without dead ends: 926 [2019-11-28 00:26:37,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-28 00:26:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-28 00:26:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-28 00:26:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-11-28 00:26:37,556 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-11-28 00:26:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,556 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-11-28 00:26:37,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-11-28 00:26:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 00:26:37,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,560 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:37,560 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-11-28 00:26:37,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:37,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328391561] [2019-11-28 00:26:37,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:37,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328391561] [2019-11-28 00:26:37,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:37,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:37,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976052978] [2019-11-28 00:26:37,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:37,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,592 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-11-28 00:26:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,636 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-11-28 00:26:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:37,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 00:26:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,645 INFO L225 Difference]: With dead ends: 1353 [2019-11-28 00:26:37,645 INFO L226 Difference]: Without dead ends: 622 [2019-11-28 00:26:37,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-28 00:26:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-11-28 00:26:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-28 00:26:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-11-28 00:26:37,673 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-11-28 00:26:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,673 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-11-28 00:26:37,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-11-28 00:26:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 00:26:37,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,677 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:37,677 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-11-28 00:26:37,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:37,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070674995] [2019-11-28 00:26:37,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:37,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070674995] [2019-11-28 00:26:37,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:37,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:37,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592464383] [2019-11-28 00:26:37,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:37,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,714 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-11-28 00:26:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,766 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-11-28 00:26:37,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:37,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 00:26:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,770 INFO L225 Difference]: With dead ends: 921 [2019-11-28 00:26:37,771 INFO L226 Difference]: Without dead ends: 442 [2019-11-28 00:26:37,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-28 00:26:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-11-28 00:26:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-11-28 00:26:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-11-28 00:26:37,796 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-11-28 00:26:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,797 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-11-28 00:26:37,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-11-28 00:26:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 00:26:37,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,800 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:37,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-11-28 00:26:37,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:37,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439888722] [2019-11-28 00:26:37,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:37,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439888722] [2019-11-28 00:26:37,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:37,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:37,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565843978] [2019-11-28 00:26:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:37,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,877 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-11-28 00:26:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:37,902 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-11-28 00:26:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:37,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 00:26:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:37,906 INFO L225 Difference]: With dead ends: 617 [2019-11-28 00:26:37,906 INFO L226 Difference]: Without dead ends: 344 [2019-11-28 00:26:37,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-28 00:26:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-28 00:26:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-28 00:26:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-11-28 00:26:37,968 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-11-28 00:26:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:37,970 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-11-28 00:26:37,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-11-28 00:26:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 00:26:37,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:37,972 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:37,973 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-11-28 00:26:37,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:37,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676152256] [2019-11-28 00:26:37,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676152256] [2019-11-28 00:26:38,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546163553] [2019-11-28 00:26:38,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,027 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-11-28 00:26:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:38,093 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-11-28 00:26:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:38,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 00:26:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:38,098 INFO L225 Difference]: With dead ends: 922 [2019-11-28 00:26:38,098 INFO L226 Difference]: Without dead ends: 665 [2019-11-28 00:26:38,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-28 00:26:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-11-28 00:26:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-28 00:26:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-11-28 00:26:38,130 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-11-28 00:26:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:38,131 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-11-28 00:26:38,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-11-28 00:26:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 00:26:38,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:38,134 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,134 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-11-28 00:26:38,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066572255] [2019-11-28 00:26:38,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066572255] [2019-11-28 00:26:38,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681325554] [2019-11-28 00:26:38,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,170 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-11-28 00:26:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:38,228 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-11-28 00:26:38,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:38,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 00:26:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:38,233 INFO L225 Difference]: With dead ends: 1151 [2019-11-28 00:26:38,233 INFO L226 Difference]: Without dead ends: 782 [2019-11-28 00:26:38,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-28 00:26:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-11-28 00:26:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-28 00:26:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-11-28 00:26:38,273 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-11-28 00:26:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:38,274 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-11-28 00:26:38,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-11-28 00:26:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 00:26:38,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:38,277 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,277 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-11-28 00:26:38,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190219497] [2019-11-28 00:26:38,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190219497] [2019-11-28 00:26:38,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243493662] [2019-11-28 00:26:38,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,307 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-11-28 00:26:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:38,357 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-11-28 00:26:38,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:38,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 00:26:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:38,360 INFO L225 Difference]: With dead ends: 1061 [2019-11-28 00:26:38,360 INFO L226 Difference]: Without dead ends: 572 [2019-11-28 00:26:38,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-28 00:26:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-11-28 00:26:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-11-28 00:26:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-11-28 00:26:38,392 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-11-28 00:26:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:38,393 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-11-28 00:26:38,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-11-28 00:26:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:26:38,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:38,396 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,397 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-11-28 00:26:38,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184461426] [2019-11-28 00:26:38,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184461426] [2019-11-28 00:26:38,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217794726] [2019-11-28 00:26:38,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,446 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-11-28 00:26:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:38,479 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-11-28 00:26:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:38,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 00:26:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:38,482 INFO L225 Difference]: With dead ends: 741 [2019-11-28 00:26:38,482 INFO L226 Difference]: Without dead ends: 478 [2019-11-28 00:26:38,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-28 00:26:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-11-28 00:26:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-28 00:26:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-11-28 00:26:38,512 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-11-28 00:26:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:38,513 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-11-28 00:26:38,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-11-28 00:26:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:26:38,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:38,515 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,515 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-11-28 00:26:38,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131734115] [2019-11-28 00:26:38,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131734115] [2019-11-28 00:26:38,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679894022] [2019-11-28 00:26:38,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,566 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-11-28 00:26:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:38,667 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-11-28 00:26:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:38,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 00:26:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:38,673 INFO L225 Difference]: With dead ends: 1220 [2019-11-28 00:26:38,673 INFO L226 Difference]: Without dead ends: 909 [2019-11-28 00:26:38,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-28 00:26:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-11-28 00:26:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-28 00:26:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-11-28 00:26:38,726 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-11-28 00:26:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:38,726 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-11-28 00:26:38,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-11-28 00:26:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:26:38,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:38,730 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,730 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-11-28 00:26:38,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577645878] [2019-11-28 00:26:38,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577645878] [2019-11-28 00:26:38,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132534044] [2019-11-28 00:26:38,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,792 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-11-28 00:26:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:38,845 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-11-28 00:26:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:38,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-28 00:26:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:38,851 INFO L225 Difference]: With dead ends: 1075 [2019-11-28 00:26:38,851 INFO L226 Difference]: Without dead ends: 1072 [2019-11-28 00:26:38,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-11-28 00:26:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-11-28 00:26:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-11-28 00:26:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-11-28 00:26:38,904 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-11-28 00:26:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:38,904 INFO L462 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-11-28 00:26:38,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-11-28 00:26:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 00:26:38,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:38,907 INFO L410 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:38,908 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:38,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-11-28 00:26:38,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:38,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270969521] [2019-11-28 00:26:38,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:38,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270969521] [2019-11-28 00:26:38,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:38,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:38,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425368680] [2019-11-28 00:26:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:38,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:38,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:38,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:38,946 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-11-28 00:26:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:39,015 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-11-28 00:26:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:39,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-28 00:26:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:39,021 INFO L225 Difference]: With dead ends: 1999 [2019-11-28 00:26:39,021 INFO L226 Difference]: Without dead ends: 1006 [2019-11-28 00:26:39,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-28 00:26:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-11-28 00:26:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-28 00:26:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-11-28 00:26:39,082 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-11-28 00:26:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:39,083 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-11-28 00:26:39,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-11-28 00:26:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 00:26:39,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:39,086 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:39,086 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-11-28 00:26:39,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:39,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996711533] [2019-11-28 00:26:39,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:39,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996711533] [2019-11-28 00:26:39,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:39,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:26:39,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073626360] [2019-11-28 00:26:39,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:26:39,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:26:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:26:39,139 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-11-28 00:26:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:39,212 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-11-28 00:26:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:26:39,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-28 00:26:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:39,218 INFO L225 Difference]: With dead ends: 1579 [2019-11-28 00:26:39,218 INFO L226 Difference]: Without dead ends: 940 [2019-11-28 00:26:39,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-28 00:26:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-28 00:26:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-28 00:26:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-11-28 00:26:39,289 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-11-28 00:26:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:39,290 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-11-28 00:26:39,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:26:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-11-28 00:26:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 00:26:39,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:39,293 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:39,293 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-11-28 00:26:39,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:39,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085660432] [2019-11-28 00:26:39,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:39,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085660432] [2019-11-28 00:26:39,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:39,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:26:39,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212013153] [2019-11-28 00:26:39,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:26:39,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:26:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:26:39,346 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-11-28 00:26:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:39,437 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-11-28 00:26:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:26:39,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-28 00:26:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:39,443 INFO L225 Difference]: With dead ends: 1579 [2019-11-28 00:26:39,444 INFO L226 Difference]: Without dead ends: 940 [2019-11-28 00:26:39,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-28 00:26:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-28 00:26:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-28 00:26:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-11-28 00:26:39,534 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-11-28 00:26:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:39,534 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-11-28 00:26:39,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:26:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-11-28 00:26:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:26:39,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:39,537 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:39,537 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-11-28 00:26:39,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:39,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481157751] [2019-11-28 00:26:39,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:39,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481157751] [2019-11-28 00:26:39,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:39,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:39,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82833505] [2019-11-28 00:26:39,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:39,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:39,569 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-11-28 00:26:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:39,665 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-11-28 00:26:39,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:39,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-28 00:26:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:39,675 INFO L225 Difference]: With dead ends: 2176 [2019-11-28 00:26:39,675 INFO L226 Difference]: Without dead ends: 1537 [2019-11-28 00:26:39,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-11-28 00:26:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-11-28 00:26:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-28 00:26:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-11-28 00:26:39,750 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-11-28 00:26:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:39,750 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-11-28 00:26:39,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-11-28 00:26:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 00:26:39,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:39,754 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:39,754 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-11-28 00:26:39,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:39,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318591669] [2019-11-28 00:26:39,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:39,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318591669] [2019-11-28 00:26:39,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:39,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:26:39,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189528030] [2019-11-28 00:26:39,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:26:39,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:26:39,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:26:39,807 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-11-28 00:26:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:39,882 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-11-28 00:26:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:26:39,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-28 00:26:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:39,889 INFO L225 Difference]: With dead ends: 1591 [2019-11-28 00:26:39,890 INFO L226 Difference]: Without dead ends: 934 [2019-11-28 00:26:39,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-28 00:26:39,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-28 00:26:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-28 00:26:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-11-28 00:26:39,975 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-11-28 00:26:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:39,975 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-11-28 00:26:39,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:26:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-11-28 00:26:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:26:39,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:39,979 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:39,979 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-11-28 00:26:39,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:39,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921198921] [2019-11-28 00:26:39,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:40,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921198921] [2019-11-28 00:26:40,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:40,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:40,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877116197] [2019-11-28 00:26:40,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:40,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:40,026 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-11-28 00:26:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:40,172 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-11-28 00:26:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:40,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 00:26:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:40,182 INFO L225 Difference]: With dead ends: 2188 [2019-11-28 00:26:40,182 INFO L226 Difference]: Without dead ends: 1555 [2019-11-28 00:26:40,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-28 00:26:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-11-28 00:26:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-28 00:26:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-11-28 00:26:40,283 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-11-28 00:26:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:40,283 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-11-28 00:26:40,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-11-28 00:26:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:26:40,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:40,285 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:40,286 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:40,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:40,286 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-11-28 00:26:40,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:40,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628733267] [2019-11-28 00:26:40,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:40,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628733267] [2019-11-28 00:26:40,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:40,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:40,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271471227] [2019-11-28 00:26:40,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:40,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:40,339 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-11-28 00:26:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:40,468 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-11-28 00:26:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:40,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 00:26:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:40,476 INFO L225 Difference]: With dead ends: 2220 [2019-11-28 00:26:40,476 INFO L226 Difference]: Without dead ends: 1563 [2019-11-28 00:26:40,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-28 00:26:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-11-28 00:26:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-28 00:26:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-11-28 00:26:40,601 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-11-28 00:26:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:40,602 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-11-28 00:26:40,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:40,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-11-28 00:26:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:26:40,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:40,605 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:40,608 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-11-28 00:26:40,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:40,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431950050] [2019-11-28 00:26:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:40,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431950050] [2019-11-28 00:26:40,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695507336] [2019-11-28 00:26:40,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:40,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 00:26:40,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:40,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:26:40,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-28 00:26:40,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857056336] [2019-11-28 00:26:40,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:26:40,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:26:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:40,906 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 4 states. [2019-11-28 00:26:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:41,172 INFO L93 Difference]: Finished difference Result 2609 states and 3234 transitions. [2019-11-28 00:26:41,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:26:41,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 00:26:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:41,181 INFO L225 Difference]: With dead ends: 2609 [2019-11-28 00:26:41,181 INFO L226 Difference]: Without dead ends: 1906 [2019-11-28 00:26:41,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-28 00:26:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1610. [2019-11-28 00:26:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-11-28 00:26:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-11-28 00:26:41,345 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-11-28 00:26:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:41,346 INFO L462 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-11-28 00:26:41,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:26:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-11-28 00:26:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:26:41,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:41,349 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:41,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:41,553 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:41,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-11-28 00:26:41,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:41,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303915368] [2019-11-28 00:26:41,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:41,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303915368] [2019-11-28 00:26:41,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:41,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:26:41,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679405188] [2019-11-28 00:26:41,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:26:41,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:26:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:41,588 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-11-28 00:26:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:41,766 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-11-28 00:26:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:26:41,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-28 00:26:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:41,779 INFO L225 Difference]: With dead ends: 3706 [2019-11-28 00:26:41,779 INFO L226 Difference]: Without dead ends: 2603 [2019-11-28 00:26:41,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:26:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-11-28 00:26:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-11-28 00:26:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-28 00:26:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-11-28 00:26:41,907 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-11-28 00:26:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:41,907 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-11-28 00:26:41,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:26:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-11-28 00:26:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:26:41,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:41,911 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 00:26:41,912 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-11-28 00:26:41,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:41,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432321673] [2019-11-28 00:26:41,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:41,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432321673] [2019-11-28 00:26:41,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:41,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:26:41,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113194798] [2019-11-28 00:26:41,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:26:41,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:26:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:26:41,958 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-11-28 00:26:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:42,039 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-11-28 00:26:42,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:26:42,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 00:26:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:42,040 INFO L225 Difference]: With dead ends: 1970 [2019-11-28 00:26:42,040 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:26:42,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:26:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:26:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:26:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:26:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:26:42,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-28 00:26:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:42,043 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:26:42,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:26:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:26:42,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:26:42,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:26:42,224 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 00:26:42,369 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 00:26:42,715 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-28 00:26:43,853 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-28 00:26:44,108 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-28 00:26:44,686 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 00:26:45,411 WARN L192 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:45,934 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 00:26:46,278 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 00:26:46,497 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 00:26:47,294 WARN L192 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-28 00:26:47,487 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 00:26:47,847 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 00:26:48,542 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:48,750 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 00:26:49,099 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 00:26:49,292 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 00:26:49,798 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 00:26:50,307 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 00:26:50,627 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 00:26:51,325 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:51,503 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 00:26:52,228 WARN L192 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:52,580 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 00:26:52,999 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-28 00:26:53,355 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-28 00:26:53,609 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-28 00:26:54,369 WARN L192 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:54,558 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-28 00:26:55,254 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:55,747 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-28 00:26:56,453 WARN L192 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-28 00:26:57,162 WARN L192 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-28 00:26:57,945 WARN L192 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-28 00:26:57,949 INFO L246 CegarLoopResult]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-11-28 00:26:57,949 INFO L249 CegarLoopResult]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-11-28 00:26:57,950 INFO L242 CegarLoopResult]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,950 INFO L246 CegarLoopResult]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-11-28 00:26:57,950 INFO L242 CegarLoopResult]: At program point L202-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~d1_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= 1 ~b1_req_up~0)) (.cse15 (<= 2 ~z_ev~0)) (.cse16 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~b0_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~b0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2019-11-28 00:26:57,950 INFO L246 CegarLoopResult]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-11-28 00:26:57,951 INFO L242 CegarLoopResult]: At program point L202-3(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,951 INFO L246 CegarLoopResult]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-11-28 00:26:57,951 INFO L246 CegarLoopResult]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-11-28 00:26:57,951 INFO L246 CegarLoopResult]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-11-28 00:26:57,951 INFO L246 CegarLoopResult]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-11-28 00:26:57,951 INFO L246 CegarLoopResult]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-11-28 00:26:57,952 INFO L246 CegarLoopResult]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-11-28 00:26:57,952 INFO L246 CegarLoopResult]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-11-28 00:26:57,952 INFO L242 CegarLoopResult]: At program point L404(lines 393 406) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 00:26:57,953 INFO L242 CegarLoopResult]: At program point L405(lines 389 407) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-28 00:26:57,953 INFO L246 CegarLoopResult]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-28 00:26:57,954 INFO L246 CegarLoopResult]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-11-28 00:26:57,954 INFO L246 CegarLoopResult]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-11-28 00:26:57,954 INFO L242 CegarLoopResult]: At program point L209(lines 201 239) the Hoare annotation is: (let ((.cse19 (= ~b1_ev~0 0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse10 (= ~d1_req_up~0 1)) (.cse11 (= 0 ~z_val_t~0)) (.cse12 (<= ~z_val~0 0)) (.cse20 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0)) (.cse18 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-28 00:26:57,954 INFO L242 CegarLoopResult]: At program point L209-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,954 INFO L246 CegarLoopResult]: For program point L276(line 276) no Hoare annotation was computed. [2019-11-28 00:26:57,954 INFO L246 CegarLoopResult]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,955 INFO L246 CegarLoopResult]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,955 INFO L246 CegarLoopResult]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-28 00:26:57,955 INFO L246 CegarLoopResult]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,958 INFO L242 CegarLoopResult]: At program point L245-1(lines 311 315) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,958 INFO L246 CegarLoopResult]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,958 INFO L246 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-28 00:26:57,958 INFO L246 CegarLoopResult]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-11-28 00:26:57,959 INFO L242 CegarLoopResult]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0)) [2019-11-28 00:26:57,959 INFO L246 CegarLoopResult]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-28 00:26:57,959 INFO L246 CegarLoopResult]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-11-28 00:26:57,959 INFO L246 CegarLoopResult]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-11-28 00:26:57,959 INFO L242 CegarLoopResult]: At program point L380-2(lines 344 348) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,959 INFO L246 CegarLoopResult]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-11-28 00:26:57,960 INFO L242 CegarLoopResult]: At program point L380-5(lines 344 348) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,960 INFO L242 CegarLoopResult]: At program point L480(lines 451 482) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 2 ~d1_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (<= ~z_val~0 0) (<= 1 ~d0_val_t~0) (= 1 ~b1_req_up~0) (<= 2 ~z_ev~0) (= ~d0_req_up~0 1)) [2019-11-28 00:26:57,960 INFO L242 CegarLoopResult]: At program point L216(lines 201 239) the Hoare annotation is: (let ((.cse20 (<= 2 ~b0_ev~0)) (.cse9 (= 0 ~d0_ev~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse19 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse21 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~d1_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse8 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 1 ~d0_val_t~0)) (.cse15 (<= ~b0_req_up~0 0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse21 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2019-11-28 00:26:57,960 INFO L242 CegarLoopResult]: At program point L216-1(lines 201 239) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse19 (= 0 ~d0_ev~0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,960 INFO L246 CegarLoopResult]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L246 CegarLoopResult]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L246 CegarLoopResult]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L246 CegarLoopResult]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L246 CegarLoopResult]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L246 CegarLoopResult]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:26:57,961 INFO L242 CegarLoopResult]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,962 INFO L242 CegarLoopResult]: At program point L119-1(lines 96 121) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,962 INFO L242 CegarLoopResult]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,962 INFO L242 CegarLoopResult]: At program point L120(lines 93 122) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,962 INFO L242 CegarLoopResult]: At program point L120-1(lines 93 122) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,962 INFO L246 CegarLoopResult]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-11-28 00:26:57,963 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:26:57,964 INFO L242 CegarLoopResult]: At program point L223(lines 201 239) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,964 INFO L242 CegarLoopResult]: At program point L223-1(lines 201 239) the Hoare annotation is: (let ((.cse3 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse19 (= 0 ~d0_ev~0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,964 INFO L246 CegarLoopResult]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-28 00:26:57,964 INFO L246 CegarLoopResult]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-28 00:26:57,964 INFO L246 CegarLoopResult]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-28 00:26:57,964 INFO L246 CegarLoopResult]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L242 CegarLoopResult]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L423(line 423) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L246 CegarLoopResult]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-11-28 00:26:57,965 INFO L249 CegarLoopResult]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L246 CegarLoopResult]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-11-28 00:26:57,966 INFO L242 CegarLoopResult]: At program point L230(lines 245 249) the Hoare annotation is: (let ((.cse18 (= ~b1_ev~0 0)) (.cse9 (= 0 ~d0_ev~0)) (.cse20 (= ~b0_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,967 INFO L242 CegarLoopResult]: At program point L230-1(lines 198 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~d0_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,967 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:26:57,967 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-28 00:26:57,967 INFO L246 CegarLoopResult]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-11-28 00:26:57,967 INFO L242 CegarLoopResult]: At program point L331-1(lines 307 339) the Hoare annotation is: (let ((.cse3 (= ~b1_ev~0 1)) (.cse18 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse8 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse19 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse4 .cse19 .cse6 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-28 00:26:57,968 INFO L242 CegarLoopResult]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,968 INFO L242 CegarLoopResult]: At program point L364-3(lines 340 372) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 00:26:57,968 INFO L242 CegarLoopResult]: At program point L331-3(lines 307 339) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 1 ~d0_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,968 INFO L242 CegarLoopResult]: At program point L265-1(lines 257 267) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 00:26:57,968 INFO L242 CegarLoopResult]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-28 00:26:57,969 INFO L242 CegarLoopResult]: At program point L266-1(lines 254 268) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2019-11-28 00:26:57,969 INFO L246 CegarLoopResult]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-11-28 00:26:57,969 INFO L246 CegarLoopResult]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-11-28 00:26:58,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:58 BoogieIcfgContainer [2019-11-28 00:26:58,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:58,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:58,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:58,081 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:58,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:35" (3/4) ... [2019-11-28 00:26:58,086 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:26:58,114 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:26:58,115 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:26:58,287 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:58,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:58,289 INFO L168 Benchmark]: Toolchain (without parser) took 23884.07 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 617.1 MB). Free memory was 952.3 MB in the beginning and 1.6 GB in the end (delta: -602.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:58,289 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:58,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:58,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:58,290 INFO L168 Benchmark]: Boogie Preprocessor took 58.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:58,291 INFO L168 Benchmark]: RCFGBuilder took 671.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:58,292 INFO L168 Benchmark]: TraceAbstraction took 22347.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 471.3 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -475.2 MB). Peak memory consumption was 683.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:58,292 INFO L168 Benchmark]: Witness Printer took 206.24 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:58,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 545.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 671.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22347.57 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 471.3 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -475.2 MB). Peak memory consumption was 683.4 MB. Max. memory is 11.5 GB. * Witness Printer took 206.24 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && b0_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1 - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 1 == b1_req_up) && 2 <= z_ev) && d0_req_up == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (z_val == 0 && b0_req_up <= 0) && b1_req_up <= 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && b1_ev == 1) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 == d0_ev) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 0 == d0_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == d0_ev) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: SAFE, OverallTime: 6.2s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.9s, HoareTripleCheckerStatistics: 4818 SDtfs, 2658 SDslu, 3080 SDs, 0 SdLazy, 294 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1628occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 2531 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5972 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63852 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32535 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2277 NumberOfCodeBlocks, 2277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 343948 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 54/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...