/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:26,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:26,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:26,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:26,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:26,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:26,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:26,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:26,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:26,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:26,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:26,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:26,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:26,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:26,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:26,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:26,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:26,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:26,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:26,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:26,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:26,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:26,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:26,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:26,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:26,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:26,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:26,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:26,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:26,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:26,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:26,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:26,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:26,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:26,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:26,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:26,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:26,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:26,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:26,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:26,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:26,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:48:26,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:26,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:26,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:26,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:26,473 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:26,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:26,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:26,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:26,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:26,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:26,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:26,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:26,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:26,476 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:26,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:26,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:26,477 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:26,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:26,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:26,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:26,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:26,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:26,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:26,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:26,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:26,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:26,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:26,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:26,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:26,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:26,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:26,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:26,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:26,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:26,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:26,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-11-23 22:48:26,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183b4fbea/a298153f7c1c4ba883ba97d2ae95b16e/FLAGa74416ee6 [2019-11-23 22:48:27,294 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:27,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-11-23 22:48:27,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183b4fbea/a298153f7c1c4ba883ba97d2ae95b16e/FLAGa74416ee6 [2019-11-23 22:48:27,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183b4fbea/a298153f7c1c4ba883ba97d2ae95b16e [2019-11-23 22:48:27,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:27,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:27,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:27,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:27,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:27,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:27" (1/1) ... [2019-11-23 22:48:27,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b864978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:27, skipping insertion in model container [2019-11-23 22:48:27,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:27" (1/1) ... [2019-11-23 22:48:27,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:27,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:27,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:27,950 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:27,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:28,109 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:28,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28 WrapperNode [2019-11-23 22:48:28,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:28,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:28,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:28,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:28,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:28,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:28,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:28,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:28,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (1/1) ... [2019-11-23 22:48:28,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:28,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:28,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:28,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:28,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (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-23 22:48:28,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:28,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:28,847 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:28,848 INFO L284 CfgBuilder]: Removed 64 assume(true) statements. [2019-11-23 22:48:28,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:28 BoogieIcfgContainer [2019-11-23 22:48:28,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:28,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:28,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:28,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:28,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:27" (1/3) ... [2019-11-23 22:48:28,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bacda7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:28, skipping insertion in model container [2019-11-23 22:48:28,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:28" (2/3) ... [2019-11-23 22:48:28,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bacda7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:28, skipping insertion in model container [2019-11-23 22:48:28,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:28" (3/3) ... [2019-11-23 22:48:28,861 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-11-23 22:48:28,871 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:28,878 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:28,890 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:28,921 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:28,922 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:28,922 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:28,922 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:28,922 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:28,923 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:28,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:28,923 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-23 22:48:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:48:28,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:28,945 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-23 22:48:28,945 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-11-23 22:48:28,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:28,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122636394] [2019-11-23 22:48:28,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,105 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-23 22:48:29,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122636394] [2019-11-23 22:48:29,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118719546] [2019-11-23 22:48:29,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,133 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-11-23 22:48:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,230 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-11-23 22:48:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:48:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,256 INFO L225 Difference]: With dead ends: 210 [2019-11-23 22:48:29,256 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 22:48:29,264 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-23 22:48:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 22:48:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-23 22:48:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 22:48:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-11-23 22:48:29,349 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-11-23 22:48:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-11-23 22:48:29,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-11-23 22:48:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:48:29,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,356 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-23 22:48:29,357 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-11-23 22:48:29,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649643495] [2019-11-23 22:48:29,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,472 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-23 22:48:29,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649643495] [2019-11-23 22:48:29,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932147792] [2019-11-23 22:48:29,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,480 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-11-23 22:48:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,528 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-11-23 22:48:29,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-23 22:48:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,532 INFO L225 Difference]: With dead ends: 199 [2019-11-23 22:48:29,532 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 22:48:29,536 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-23 22:48:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 22:48:29,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-23 22:48:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 22:48:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-11-23 22:48:29,548 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-11-23 22:48:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,549 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-11-23 22:48:29,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-11-23 22:48:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:48:29,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,552 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-23 22:48:29,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-11-23 22:48:29,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015173765] [2019-11-23 22:48:29,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,642 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-23 22:48:29,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015173765] [2019-11-23 22:48:29,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134066613] [2019-11-23 22:48:29,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,647 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-11-23 22:48:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,697 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-11-23 22:48:29,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-23 22:48:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,699 INFO L225 Difference]: With dead ends: 196 [2019-11-23 22:48:29,699 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 22:48:29,700 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-23 22:48:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 22:48:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-23 22:48:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 22:48:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-11-23 22:48:29,711 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-11-23 22:48:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,711 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-11-23 22:48:29,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-11-23 22:48:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:48:29,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,714 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-23 22:48:29,714 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-11-23 22:48:29,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366026583] [2019-11-23 22:48:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,794 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-23 22:48:29,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366026583] [2019-11-23 22:48:29,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157243286] [2019-11-23 22:48:29,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,798 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-11-23 22:48:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:29,821 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-11-23 22:48:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:29,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-23 22:48:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:29,825 INFO L225 Difference]: With dead ends: 193 [2019-11-23 22:48:29,825 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 22:48:29,827 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-23 22:48:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 22:48:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-23 22:48:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-23 22:48:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-11-23 22:48:29,845 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-11-23 22:48:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:29,845 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-11-23 22:48:29,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-11-23 22:48:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:48:29,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:29,851 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-23 22:48:29,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-11-23 22:48:29,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:29,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278665983] [2019-11-23 22:48:29,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:29,950 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-23 22:48:29,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278665983] [2019-11-23 22:48:29,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:29,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:29,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860694703] [2019-11-23 22:48:29,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:29,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:29,953 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-11-23 22:48:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,005 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-11-23 22:48:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:48:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,009 INFO L225 Difference]: With dead ends: 271 [2019-11-23 22:48:30,009 INFO L226 Difference]: Without dead ends: 191 [2019-11-23 22:48:30,010 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-23 22:48:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-23 22:48:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-11-23 22:48:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-23 22:48:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-11-23 22:48:30,035 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-11-23 22:48:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,035 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-11-23 22:48:30,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-11-23 22:48:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:48:30,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,038 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-23 22:48:30,038 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,038 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-11-23 22:48:30,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230538616] [2019-11-23 22:48:30,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,117 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-23 22:48:30,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230538616] [2019-11-23 22:48:30,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172320837] [2019-11-23 22:48:30,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,120 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-11-23 22:48:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,178 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-11-23 22:48:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:48:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,182 INFO L225 Difference]: With dead ends: 536 [2019-11-23 22:48:30,182 INFO L226 Difference]: Without dead ends: 371 [2019-11-23 22:48:30,183 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-23 22:48:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-23 22:48:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-11-23 22:48:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-23 22:48:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-11-23 22:48:30,203 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-11-23 22:48:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,203 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-11-23 22:48:30,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-11-23 22:48:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-23 22:48:30,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,206 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-23 22:48:30,206 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-11-23 22:48:30,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552391716] [2019-11-23 22:48:30,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,240 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-23 22:48:30,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552391716] [2019-11-23 22:48:30,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645956758] [2019-11-23 22:48:30,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,243 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-11-23 22:48:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,300 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-11-23 22:48:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-23 22:48:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,304 INFO L225 Difference]: With dead ends: 697 [2019-11-23 22:48:30,304 INFO L226 Difference]: Without dead ends: 408 [2019-11-23 22:48:30,305 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-23 22:48:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-11-23 22:48:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-11-23 22:48:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-23 22:48:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-11-23 22:48:30,322 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-11-23 22:48:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,322 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-11-23 22:48:30,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-11-23 22:48:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:30,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,324 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-23 22:48:30,325 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-11-23 22:48:30,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644392061] [2019-11-23 22:48:30,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,375 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-23 22:48:30,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644392061] [2019-11-23 22:48:30,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600727161] [2019-11-23 22:48:30,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,378 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-11-23 22:48:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,451 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-11-23 22:48:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,456 INFO L225 Difference]: With dead ends: 1166 [2019-11-23 22:48:30,457 INFO L226 Difference]: Without dead ends: 805 [2019-11-23 22:48:30,458 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-23 22:48:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-23 22:48:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-11-23 22:48:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-11-23 22:48:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-11-23 22:48:30,492 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-11-23 22:48:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,494 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-11-23 22:48:30,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-11-23 22:48:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:30,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,497 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-23 22:48:30,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-11-23 22:48:30,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075158061] [2019-11-23 22:48:30,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,567 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-23 22:48:30,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075158061] [2019-11-23 22:48:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190592541] [2019-11-23 22:48:30,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,570 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-11-23 22:48:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,634 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-11-23 22:48:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,641 INFO L225 Difference]: With dead ends: 1533 [2019-11-23 22:48:30,641 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 22:48:30,642 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-23 22:48:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 22:48:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-23 22:48:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 22:48:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-11-23 22:48:30,674 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-11-23 22:48:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,674 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-11-23 22:48:30,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-11-23 22:48:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:30,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,678 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-23 22:48:30,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-11-23 22:48:30,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375854811] [2019-11-23 22:48:30,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,712 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-23 22:48:30,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375854811] [2019-11-23 22:48:30,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323066590] [2019-11-23 22:48:30,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,715 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-11-23 22:48:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,762 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-11-23 22:48:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,766 INFO L225 Difference]: With dead ends: 1353 [2019-11-23 22:48:30,766 INFO L226 Difference]: Without dead ends: 622 [2019-11-23 22:48:30,767 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-23 22:48:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-23 22:48:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-11-23 22:48:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-23 22:48:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-11-23 22:48:30,791 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-11-23 22:48:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,791 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-11-23 22:48:30,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-11-23 22:48:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 22:48:30,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,794 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-23 22:48:30,794 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-11-23 22:48:30,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367942072] [2019-11-23 22:48:30,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,820 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-23 22:48:30,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367942072] [2019-11-23 22:48:30,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398429725] [2019-11-23 22:48:30,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,822 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-11-23 22:48:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,869 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-11-23 22:48:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-23 22:48:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,872 INFO L225 Difference]: With dead ends: 921 [2019-11-23 22:48:30,873 INFO L226 Difference]: Without dead ends: 442 [2019-11-23 22:48:30,874 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-23 22:48:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-23 22:48:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-11-23 22:48:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-11-23 22:48:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-11-23 22:48:30,892 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-11-23 22:48:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-11-23 22:48:30,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-11-23 22:48:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:48:30,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,895 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-23 22:48:30,895 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-11-23 22:48:30,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471852943] [2019-11-23 22:48:30,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:30,930 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-23 22:48:30,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471852943] [2019-11-23 22:48:30,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:30,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:30,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364177061] [2019-11-23 22:48:30,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:30,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:30,932 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-11-23 22:48:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:30,953 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-11-23 22:48:30,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:30,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:48:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:30,956 INFO L225 Difference]: With dead ends: 617 [2019-11-23 22:48:30,956 INFO L226 Difference]: Without dead ends: 344 [2019-11-23 22:48:30,957 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-23 22:48:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-23 22:48:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-23 22:48:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-23 22:48:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-11-23 22:48:30,973 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-11-23 22:48:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:30,974 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-11-23 22:48:30,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-11-23 22:48:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:48:30,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:30,975 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-23 22:48:30,976 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-11-23 22:48:30,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:30,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432048315] [2019-11-23 22:48:30,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,019 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-23 22:48:31,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432048315] [2019-11-23 22:48:31,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480018121] [2019-11-23 22:48:31,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,021 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-11-23 22:48:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,087 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-11-23 22:48:31,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:48:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,092 INFO L225 Difference]: With dead ends: 922 [2019-11-23 22:48:31,092 INFO L226 Difference]: Without dead ends: 665 [2019-11-23 22:48:31,093 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-23 22:48:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-23 22:48:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-11-23 22:48:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-23 22:48:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-11-23 22:48:31,123 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-11-23 22:48:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,124 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-11-23 22:48:31,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-11-23 22:48:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:48:31,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,126 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-23 22:48:31,127 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-11-23 22:48:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491977088] [2019-11-23 22:48:31,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,151 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-23 22:48:31,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491977088] [2019-11-23 22:48:31,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140814631] [2019-11-23 22:48:31,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,154 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-11-23 22:48:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,211 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-11-23 22:48:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:48:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,215 INFO L225 Difference]: With dead ends: 1151 [2019-11-23 22:48:31,216 INFO L226 Difference]: Without dead ends: 782 [2019-11-23 22:48:31,217 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-23 22:48:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-11-23 22:48:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-11-23 22:48:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-23 22:48:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-11-23 22:48:31,253 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-11-23 22:48:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,253 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-11-23 22:48:31,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-11-23 22:48:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:48:31,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,257 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-23 22:48:31,258 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,258 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-11-23 22:48:31,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719035603] [2019-11-23 22:48:31,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,292 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-23 22:48:31,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719035603] [2019-11-23 22:48:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981877030] [2019-11-23 22:48:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,295 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-11-23 22:48:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,358 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-11-23 22:48:31,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-23 22:48:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,362 INFO L225 Difference]: With dead ends: 1061 [2019-11-23 22:48:31,363 INFO L226 Difference]: Without dead ends: 572 [2019-11-23 22:48:31,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-23 22:48:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-23 22:48:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-11-23 22:48:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-11-23 22:48:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-11-23 22:48:31,392 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-11-23 22:48:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,392 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-11-23 22:48:31,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-11-23 22:48:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:48:31,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,395 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-23 22:48:31,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-11-23 22:48:31,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982336530] [2019-11-23 22:48:31,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,430 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-23 22:48:31,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982336530] [2019-11-23 22:48:31,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602328166] [2019-11-23 22:48:31,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,433 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-11-23 22:48:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,462 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-11-23 22:48:31,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 22:48:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,465 INFO L225 Difference]: With dead ends: 741 [2019-11-23 22:48:31,465 INFO L226 Difference]: Without dead ends: 478 [2019-11-23 22:48:31,466 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-23 22:48:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-23 22:48:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-11-23 22:48:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-23 22:48:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-11-23 22:48:31,519 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-11-23 22:48:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,519 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-11-23 22:48:31,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-11-23 22:48:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:48:31,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,521 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-23 22:48:31,522 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-11-23 22:48:31,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447636804] [2019-11-23 22:48:31,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,555 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-23 22:48:31,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447636804] [2019-11-23 22:48:31,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052129803] [2019-11-23 22:48:31,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,558 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-11-23 22:48:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,630 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-11-23 22:48:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 22:48:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,636 INFO L225 Difference]: With dead ends: 1220 [2019-11-23 22:48:31,636 INFO L226 Difference]: Without dead ends: 909 [2019-11-23 22:48:31,637 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-23 22:48:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-23 22:48:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-11-23 22:48:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-11-23 22:48:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-11-23 22:48:31,681 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-11-23 22:48:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,681 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-11-23 22:48:31,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-11-23 22:48:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:48:31,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,685 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-23 22:48:31,685 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-11-23 22:48:31,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308294538] [2019-11-23 22:48:31,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,725 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-23 22:48:31,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308294538] [2019-11-23 22:48:31,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745740673] [2019-11-23 22:48:31,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,728 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-11-23 22:48:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,786 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-11-23 22:48:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-23 22:48:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,792 INFO L225 Difference]: With dead ends: 1075 [2019-11-23 22:48:31,792 INFO L226 Difference]: Without dead ends: 1072 [2019-11-23 22:48:31,793 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-23 22:48:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-11-23 22:48:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-11-23 22:48:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-11-23 22:48:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-11-23 22:48:31,850 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-11-23 22:48:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:31,851 INFO L462 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-11-23 22:48:31,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-11-23 22:48:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 22:48:31,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:31,855 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-23 22:48:31,856 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-11-23 22:48:31,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:31,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097565721] [2019-11-23 22:48:31,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:31,892 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-23 22:48:31,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097565721] [2019-11-23 22:48:31,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:31,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:31,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828922984] [2019-11-23 22:48:31,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:31,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:31,895 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-11-23 22:48:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:31,967 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-11-23 22:48:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:31,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-23 22:48:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:31,975 INFO L225 Difference]: With dead ends: 1999 [2019-11-23 22:48:31,975 INFO L226 Difference]: Without dead ends: 1006 [2019-11-23 22:48:31,977 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-23 22:48:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-23 22:48:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-11-23 22:48:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-23 22:48:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-11-23 22:48:32,038 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-11-23 22:48:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,039 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-11-23 22:48:32,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-11-23 22:48:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 22:48:32,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,043 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-23 22:48:32,043 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-11-23 22:48:32,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120067360] [2019-11-23 22:48:32,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,122 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-23 22:48:32,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120067360] [2019-11-23 22:48:32,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:32,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63463017] [2019-11-23 22:48:32,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:32,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:32,125 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-11-23 22:48:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,191 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-11-23 22:48:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:32,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-23 22:48:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,197 INFO L225 Difference]: With dead ends: 1579 [2019-11-23 22:48:32,197 INFO L226 Difference]: Without dead ends: 940 [2019-11-23 22:48:32,199 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-23 22:48:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-23 22:48:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-23 22:48:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-23 22:48:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-11-23 22:48:32,254 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-11-23 22:48:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,254 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-11-23 22:48:32,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-11-23 22:48:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-23 22:48:32,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,257 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-23 22:48:32,257 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-11-23 22:48:32,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782821328] [2019-11-23 22:48:32,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,297 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-23 22:48:32,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782821328] [2019-11-23 22:48:32,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:32,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077156839] [2019-11-23 22:48:32,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:32,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:32,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:32,299 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-11-23 22:48:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,373 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-11-23 22:48:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:32,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-23 22:48:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,379 INFO L225 Difference]: With dead ends: 1579 [2019-11-23 22:48:32,379 INFO L226 Difference]: Without dead ends: 940 [2019-11-23 22:48:32,381 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-23 22:48:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-23 22:48:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-23 22:48:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-23 22:48:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-11-23 22:48:32,443 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-11-23 22:48:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,444 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-11-23 22:48:32,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-11-23 22:48:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 22:48:32,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,446 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-23 22:48:32,446 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-11-23 22:48:32,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831262562] [2019-11-23 22:48:32,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,475 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-23 22:48:32,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831262562] [2019-11-23 22:48:32,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:32,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366527656] [2019-11-23 22:48:32,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,477 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-11-23 22:48:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,593 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-11-23 22:48:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:32,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 22:48:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,601 INFO L225 Difference]: With dead ends: 2176 [2019-11-23 22:48:32,602 INFO L226 Difference]: Without dead ends: 1537 [2019-11-23 22:48:32,603 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-23 22:48:32,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-11-23 22:48:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-11-23 22:48:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-23 22:48:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-11-23 22:48:32,684 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-11-23 22:48:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,684 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-11-23 22:48:32,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-11-23 22:48:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:48:32,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,688 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-23 22:48:32,688 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-11-23 22:48:32,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220573292] [2019-11-23 22:48:32,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,740 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-23 22:48:32,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220573292] [2019-11-23 22:48:32,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:32,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721318496] [2019-11-23 22:48:32,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:32,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:32,742 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-11-23 22:48:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:32,815 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-11-23 22:48:32,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:32,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-23 22:48:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:32,821 INFO L225 Difference]: With dead ends: 1591 [2019-11-23 22:48:32,821 INFO L226 Difference]: Without dead ends: 934 [2019-11-23 22:48:32,822 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-23 22:48:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-23 22:48:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-23 22:48:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-23 22:48:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-11-23 22:48:32,891 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-11-23 22:48:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:32,891 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-11-23 22:48:32,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-11-23 22:48:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:48:32,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:32,894 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-23 22:48:32,894 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-11-23 22:48:32,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:32,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177619914] [2019-11-23 22:48:32,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:32,924 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-23 22:48:32,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177619914] [2019-11-23 22:48:32,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:32,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:32,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821489735] [2019-11-23 22:48:32,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:32,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:32,926 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-11-23 22:48:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,033 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-11-23 22:48:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-23 22:48:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,043 INFO L225 Difference]: With dead ends: 2188 [2019-11-23 22:48:33,043 INFO L226 Difference]: Without dead ends: 1555 [2019-11-23 22:48:33,045 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-23 22:48:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-23 22:48:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-11-23 22:48:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-11-23 22:48:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-11-23 22:48:33,149 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-11-23 22:48:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,149 INFO L462 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-11-23 22:48:33,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-11-23 22:48:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:48:33,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,152 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-23 22:48:33,152 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-11-23 22:48:33,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373876446] [2019-11-23 22:48:33,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,181 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-23 22:48:33,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373876446] [2019-11-23 22:48:33,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:33,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:33,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96935755] [2019-11-23 22:48:33,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:33,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:33,183 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-11-23 22:48:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,294 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-11-23 22:48:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:33,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-23 22:48:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,302 INFO L225 Difference]: With dead ends: 2220 [2019-11-23 22:48:33,302 INFO L226 Difference]: Without dead ends: 1563 [2019-11-23 22:48:33,304 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-23 22:48:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-11-23 22:48:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-11-23 22:48:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-23 22:48:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-11-23 22:48:33,407 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-11-23 22:48:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:33,408 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-11-23 22:48:33,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-11-23 22:48:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:48:33,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:33,411 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-23 22:48:33,412 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-11-23 22:48:33,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:33,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986880963] [2019-11-23 22:48:33,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,494 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-23 22:48:33,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986880963] [2019-11-23 22:48:33,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246454349] [2019-11-23 22:48:33,495 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-23 22:48:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:33,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 22:48:33,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:33,677 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-23 22:48:33,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:48:33,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-23 22:48:33,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847973716] [2019-11-23 22:48:33,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:33,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:33,680 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 4 states. [2019-11-23 22:48:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:33,882 INFO L93 Difference]: Finished difference Result 2609 states and 3234 transitions. [2019-11-23 22:48:33,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:33,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-23 22:48:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:33,892 INFO L225 Difference]: With dead ends: 2609 [2019-11-23 22:48:33,892 INFO L226 Difference]: Without dead ends: 1906 [2019-11-23 22:48:33,894 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-23 22:48:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-23 22:48:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1610. [2019-11-23 22:48:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-11-23 22:48:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-11-23 22:48:34,014 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-11-23 22:48:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,014 INFO L462 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-11-23 22:48:34,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-11-23 22:48:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:48:34,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:34,019 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-23 22:48:34,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:34,224 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-11-23 22:48:34,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:34,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409112094] [2019-11-23 22:48:34,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,270 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-23 22:48:34,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409112094] [2019-11-23 22:48:34,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:34,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:34,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950936289] [2019-11-23 22:48:34,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:34,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:34,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:34,272 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-11-23 22:48:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,450 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-11-23 22:48:34,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:34,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-23 22:48:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,462 INFO L225 Difference]: With dead ends: 3706 [2019-11-23 22:48:34,462 INFO L226 Difference]: Without dead ends: 2603 [2019-11-23 22:48:34,465 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-23 22:48:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-11-23 22:48:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-11-23 22:48:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-11-23 22:48:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-11-23 22:48:34,677 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-11-23 22:48:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,677 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-11-23 22:48:34,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-11-23 22:48:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 22:48:34,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:34,682 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-23 22:48:34,682 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-11-23 22:48:34,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:34,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736619657] [2019-11-23 22:48:34,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:34,748 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-23 22:48:34,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736619657] [2019-11-23 22:48:34,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:34,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:34,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124356732] [2019-11-23 22:48:34,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:34,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:34,750 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-11-23 22:48:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:34,847 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-11-23 22:48:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:34,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-23 22:48:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:34,848 INFO L225 Difference]: With dead ends: 1970 [2019-11-23 22:48:34,848 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:48:34,851 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-23 22:48:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:48:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:48:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:48:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:48:34,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-23 22:48:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:34,852 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:48:34,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:48:34,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:48:34,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:48:35,036 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-23 22:48:35,193 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-23 22:48:35,506 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-23 22:48:36,388 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-11-23 22:48:36,678 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-23 22:48:36,895 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-11-23 22:48:37,478 WARN L192 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-23 22:48:38,196 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:38,656 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-23 22:48:38,992 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-23 22:48:39,178 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 22:48:39,972 WARN L192 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-23 22:48:40,161 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 22:48:40,503 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-23 22:48:41,248 WARN L192 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:41,454 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 22:48:41,829 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-23 22:48:42,018 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 22:48:42,502 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-23 22:48:43,005 WARN L192 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-23 22:48:43,353 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-23 22:48:44,064 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:44,259 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 22:48:44,920 WARN L192 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:45,255 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-23 22:48:45,682 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-23 22:48:46,031 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-11-23 22:48:46,250 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-23 22:48:46,986 WARN L192 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:47,173 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 22:48:47,888 WARN L192 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:48,379 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-11-23 22:48:49,068 WARN L192 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-23 22:48:49,781 WARN L192 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 49 [2019-11-23 22:48:50,576 WARN L192 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-23 22:48:50,581 INFO L444 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-11-23 22:48:50,581 INFO L447 ceAbstractionStarter]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-11-23 22:48:50,581 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,581 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-11-23 22:48:50,582 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,582 INFO L444 ceAbstractionStarter]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-11-23 22:48:50,582 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,582 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-11-23 22:48:50,582 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-11-23 22:48:50,583 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-11-23 22:48:50,583 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-11-23 22:48:50,583 INFO L444 ceAbstractionStarter]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-11-23 22:48:50,583 INFO L444 ceAbstractionStarter]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-11-23 22:48:50,583 INFO L444 ceAbstractionStarter]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-11-23 22:48:50,583 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,584 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-11-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-11-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-11-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-11-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-11-23 22:48:50,584 INFO L444 ceAbstractionStarter]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-11-23 22:48:50,585 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-11-23 22:48:50,585 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-23 22:48:50,585 INFO L444 ceAbstractionStarter]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-11-23 22:48:50,585 INFO L444 ceAbstractionStarter]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-11-23 22:48:50,585 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,586 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,586 INFO L444 ceAbstractionStarter]: For program point L276(line 276) no Hoare annotation was computed. [2019-11-23 22:48:50,586 INFO L444 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,586 INFO L444 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,586 INFO L444 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-11-23 22:48:50,586 INFO L444 ceAbstractionStarter]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,586 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,587 INFO L444 ceAbstractionStarter]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,587 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-11-23 22:48:50,587 INFO L444 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-11-23 22:48:50,587 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,587 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-23 22:48:50,587 INFO L444 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-11-23 22:48:50,587 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-11-23 22:48:50,588 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,588 INFO L444 ceAbstractionStarter]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-11-23 22:48:50,588 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,588 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,588 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,589 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,589 INFO L444 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-11-23 22:48:50,589 INFO L444 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,589 INFO L444 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,589 INFO L444 ceAbstractionStarter]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,589 INFO L444 ceAbstractionStarter]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,589 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-23 22:48:50,590 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:48:50,590 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,590 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,590 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,591 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,591 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,591 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-11-23 22:48:50,591 INFO L444 ceAbstractionStarter]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-11-23 22:48:50,591 INFO L444 ceAbstractionStarter]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-11-23 22:48:50,591 INFO L444 ceAbstractionStarter]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-11-23 22:48:50,591 INFO L444 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,592 INFO L444 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,592 INFO L444 ceAbstractionStarter]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,592 INFO L444 ceAbstractionStarter]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,592 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-11-23 22:48:50,592 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:48:50,592 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,593 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,593 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:48:50,593 INFO L444 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:48:50,593 INFO L444 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:48:50,593 INFO L444 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-11-23 22:48:50,593 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-11-23 22:48:50,594 INFO L444 ceAbstractionStarter]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L447 ceAbstractionStarter]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-11-23 22:48:50,595 INFO L444 ceAbstractionStarter]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-11-23 22:48:50,600 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,600 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,601 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:48:50,601 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-23 22:48:50,601 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-11-23 22:48:50,601 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,602 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,602 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,602 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,602 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,602 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,603 INFO L440 ceAbstractionStarter]: 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-23 22:48:50,603 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-11-23 22:48:50,603 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-11-23 22:48:50,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:50 BoogieIcfgContainer [2019-11-23 22:48:50,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:50,704 INFO L168 Benchmark]: Toolchain (without parser) took 23041.49 ms. Allocated memory was 146.3 MB in the beginning and 567.3 MB in the end (delta: 421.0 MB). Free memory was 103.6 MB in the beginning and 464.2 MB in the end (delta: -360.6 MB). Peak memory consumption was 443.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,705 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.14 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.4 MB in the beginning and 181.5 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.64 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 178.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,706 INFO L168 Benchmark]: Boogie Preprocessor took 35.44 ms. Allocated memory is still 203.9 MB. Free memory was 178.8 MB in the beginning and 176.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,706 INFO L168 Benchmark]: RCFGBuilder took 651.42 ms. Allocated memory is still 203.9 MB. Free memory was 176.8 MB in the beginning and 142.5 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,707 INFO L168 Benchmark]: TraceAbstraction took 21851.85 ms. Allocated memory was 203.9 MB in the beginning and 567.3 MB in the end (delta: 363.3 MB). Free memory was 141.8 MB in the beginning and 464.2 MB in the end (delta: -322.3 MB). Peak memory consumption was 424.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:50,709 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.51 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 446.14 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.4 MB in the beginning and 181.5 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.64 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 178.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.44 ms. Allocated memory is still 203.9 MB. Free memory was 178.8 MB in the beginning and 176.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 651.42 ms. Allocated memory is still 203.9 MB. Free memory was 176.8 MB in the beginning and 142.5 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21851.85 ms. Allocated memory was 203.9 MB in the beginning and 567.3 MB in the end (delta: 363.3 MB). Free memory was 141.8 MB in the beginning and 464.2 MB in the end (delta: -322.3 MB). Peak memory consumption was 424.3 MB. Max. memory is 7.1 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: 21.6s, OverallIterations: 28, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.7s, HoareTripleCheckerStatistics: 4818 SDtfs, 2658 SDslu, 3080 SDs, 0 SdLazy, 294 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s 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.3s 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.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s 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...