java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label36.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:34:34,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:34:34,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:34:34,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:34:34,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:34:34,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:34:34,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:34:34,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:34:34,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:34:34,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:34:34,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:34:34,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:34:34,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:34:34,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:34:34,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:34:34,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:34:34,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:34:34,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:34:34,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:34:34,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:34:34,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:34:34,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:34:34,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:34:34,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:34:34,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:34:34,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:34:34,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:34:34,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:34:34,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:34:34,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:34:34,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:34:34,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:34:34,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:34:34,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:34:34,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:34:34,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:34:34,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:34:34,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:34:34,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:34:34,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:34:34,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:34:34,717 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-10-02 01:34:34,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:34:34,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:34:34,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:34:34,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:34:34,734 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:34:34,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:34:34,735 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:34:34,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:34:34,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:34:34,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:34:34,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:34:34,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:34:34,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:34:34,736 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:34:34,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:34:34,737 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:34:34,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:34:34,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:34:34,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:34:34,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:34:34,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:34:34,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:34:34,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:34:34,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:34:34,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:34:34,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:34:34,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:34:34,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:34:34,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:34:34,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:34:34,779 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:34:34,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:34:34,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:34:34,786 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:34:34,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label36.c [2019-10-02 01:34:34,848 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272aefa37/419c6980e19e4f8eae18174c781d012d/FLAG36e97315e [2019-10-02 01:34:35,512 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:34:35,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label36.c [2019-10-02 01:34:35,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272aefa37/419c6980e19e4f8eae18174c781d012d/FLAG36e97315e [2019-10-02 01:34:35,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272aefa37/419c6980e19e4f8eae18174c781d012d [2019-10-02 01:34:35,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:34:35,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:34:35,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:34:35,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:34:35,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:34:35,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:34:35" (1/1) ... [2019-10-02 01:34:35,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:35, skipping insertion in model container [2019-10-02 01:34:35,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:34:35" (1/1) ... [2019-10-02 01:34:35,729 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:34:35,814 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:34:36,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:34:36,589 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:34:36,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:34:36,916 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:34:36,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36 WrapperNode [2019-10-02 01:34:36,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:34:36,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:34:36,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:34:36,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:34:36,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:36,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:36,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:36,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:37,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:37,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:37,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (1/1) ... [2019-10-02 01:34:37,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:34:37,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:34:37,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:34:37,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:34:37,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (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-10-02 01:34:37,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:34:37,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:34:37,182 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:34:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:34:37,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:34:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:34:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:34:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:34:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:34:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:34:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:34:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:34:37,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:34:39,670 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:34:39,670 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:34:39,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:34:39 BoogieIcfgContainer [2019-10-02 01:34:39,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:34:39,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:34:39,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:34:39,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:34:39,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:34:35" (1/3) ... [2019-10-02 01:34:39,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba80cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:34:39, skipping insertion in model container [2019-10-02 01:34:39,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:34:36" (2/3) ... [2019-10-02 01:34:39,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba80cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:34:39, skipping insertion in model container [2019-10-02 01:34:39,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:34:39" (3/3) ... [2019-10-02 01:34:39,683 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label36.c [2019-10-02 01:34:39,694 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:34:39,705 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:34:39,724 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:34:39,776 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:34:39,778 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:34:39,778 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:34:39,778 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:34:39,778 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:34:39,779 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:34:39,779 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:34:39,779 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:34:39,779 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:34:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 01:34:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 01:34:39,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:39,829 INFO L411 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] [2019-10-02 01:34:39,831 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:39,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1949415187, now seen corresponding path program 1 times [2019-10-02 01:34:39,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:39,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:39,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:39,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:34:40,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:34:40,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:34:40,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:34:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:34:40,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:34:40,192 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-10-02 01:34:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:42,653 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-10-02 01:34:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:34:42,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-02 01:34:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:42,681 INFO L225 Difference]: With dead ends: 1153 [2019-10-02 01:34:42,681 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 01:34:42,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-02 01:34:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 01:34:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 01:34:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 01:34:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1166 transitions. [2019-10-02 01:34:42,797 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1166 transitions. Word has length 42 [2019-10-02 01:34:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:42,797 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1166 transitions. [2019-10-02 01:34:42,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:34:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1166 transitions. [2019-10-02 01:34:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 01:34:42,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:42,805 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 01:34:42,805 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash -299851275, now seen corresponding path program 1 times [2019-10-02 01:34:42,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:42,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:42,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:34:43,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:34:43,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:34:43,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:34:43,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:34:43,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:34:43,174 INFO L87 Difference]: Start difference. First operand 682 states and 1166 transitions. Second operand 6 states. [2019-10-02 01:34:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:45,937 INFO L93 Difference]: Finished difference Result 1733 states and 2953 transitions. [2019-10-02 01:34:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:34:45,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-02 01:34:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:45,948 INFO L225 Difference]: With dead ends: 1733 [2019-10-02 01:34:45,949 INFO L226 Difference]: Without dead ends: 1057 [2019-10-02 01:34:45,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:34:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-10-02 01:34:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1039. [2019-10-02 01:34:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-10-02 01:34:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1701 transitions. [2019-10-02 01:34:46,005 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1701 transitions. Word has length 149 [2019-10-02 01:34:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:46,006 INFO L475 AbstractCegarLoop]: Abstraction has 1039 states and 1701 transitions. [2019-10-02 01:34:46,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:34:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1701 transitions. [2019-10-02 01:34:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 01:34:46,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:46,010 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 01:34:46,010 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1372793628, now seen corresponding path program 1 times [2019-10-02 01:34:46,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:46,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:46,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:46,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:34:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:34:46,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:34:46,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:34:46,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:34:46,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:34:46,250 INFO L87 Difference]: Start difference. First operand 1039 states and 1701 transitions. Second operand 6 states. [2019-10-02 01:34:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:48,852 INFO L93 Difference]: Finished difference Result 3130 states and 5158 transitions. [2019-10-02 01:34:48,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:34:48,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-02 01:34:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:48,868 INFO L225 Difference]: With dead ends: 3130 [2019-10-02 01:34:48,868 INFO L226 Difference]: Without dead ends: 2097 [2019-10-02 01:34:48,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:34:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2019-10-02 01:34:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2081. [2019-10-02 01:34:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-10-02 01:34:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3125 transitions. [2019-10-02 01:34:48,945 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3125 transitions. Word has length 152 [2019-10-02 01:34:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:48,955 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3125 transitions. [2019-10-02 01:34:48,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:34:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3125 transitions. [2019-10-02 01:34:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 01:34:48,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:48,971 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:34:48,972 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1534192236, now seen corresponding path program 1 times [2019-10-02 01:34:48,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 70 proven. 106 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:34:49,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:49,235 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:34:49,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:34:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:49,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:34:49,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 01:34:49,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:34:49,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:34:49,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:34:49,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:34:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:34:49,579 INFO L87 Difference]: Start difference. First operand 2081 states and 3125 transitions. Second operand 9 states. [2019-10-02 01:34:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:55,347 INFO L93 Difference]: Finished difference Result 6985 states and 10568 transitions. [2019-10-02 01:34:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 01:34:55,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 267 [2019-10-02 01:34:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:55,379 INFO L225 Difference]: With dead ends: 6985 [2019-10-02 01:34:55,379 INFO L226 Difference]: Without dead ends: 4910 [2019-10-02 01:34:55,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-10-02 01:34:55,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4910 states. [2019-10-02 01:34:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4910 to 4192. [2019-10-02 01:34:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4192 states. [2019-10-02 01:34:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5202 transitions. [2019-10-02 01:34:55,529 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5202 transitions. Word has length 267 [2019-10-02 01:34:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:55,531 INFO L475 AbstractCegarLoop]: Abstraction has 4192 states and 5202 transitions. [2019-10-02 01:34:55,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:34:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5202 transitions. [2019-10-02 01:34:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-10-02 01:34:55,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:34:55,548 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:34:55,549 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:34:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:34:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1843042403, now seen corresponding path program 1 times [2019-10-02 01:34:55,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:34:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:34:55,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:55,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:55,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:34:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:56,309 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-10-02 01:34:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 246 proven. 242 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-10-02 01:34:56,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:56,880 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:34:56,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:57,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:34:57,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 664 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 01:34:57,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:34:57,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 01:34:57,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 01:34:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 01:34:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:34:57,411 INFO L87 Difference]: Start difference. First operand 4192 states and 5202 transitions. Second operand 12 states. [2019-10-02 01:34:57,923 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-10-02 01:35:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:05,418 INFO L93 Difference]: Finished difference Result 10882 states and 13876 transitions. [2019-10-02 01:35:05,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 01:35:05,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 604 [2019-10-02 01:35:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:05,450 INFO L225 Difference]: With dead ends: 10882 [2019-10-02 01:35:05,450 INFO L226 Difference]: Without dead ends: 6696 [2019-10-02 01:35:05,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 627 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 01:35:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2019-10-02 01:35:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6295. [2019-10-02 01:35:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6295 states. [2019-10-02 01:35:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 7809 transitions. [2019-10-02 01:35:05,630 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 7809 transitions. Word has length 604 [2019-10-02 01:35:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:05,631 INFO L475 AbstractCegarLoop]: Abstraction has 6295 states and 7809 transitions. [2019-10-02 01:35:05,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 01:35:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 7809 transitions. [2019-10-02 01:35:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2019-10-02 01:35:05,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:05,683 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:35:05,683 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash -156250550, now seen corresponding path program 1 times [2019-10-02 01:35:05,684 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:05,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:05,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:05,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:05,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 568 proven. 228 refuted. 0 times theorem prover too weak. 1344 trivial. 0 not checked. [2019-10-02 01:35:06,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:06,713 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:35:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:06,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:35:06,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 1562 proven. 2 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-02 01:35:07,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:35:07,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:35:07,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:35:07,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:35:07,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:35:07,454 INFO L87 Difference]: Start difference. First operand 6295 states and 7809 transitions. Second operand 9 states. [2019-10-02 01:35:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:11,705 INFO L93 Difference]: Finished difference Result 13964 states and 17694 transitions. [2019-10-02 01:35:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 01:35:11,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1001 [2019-10-02 01:35:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:11,739 INFO L225 Difference]: With dead ends: 13964 [2019-10-02 01:35:11,739 INFO L226 Difference]: Without dead ends: 8014 [2019-10-02 01:35:11,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:35:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2019-10-02 01:35:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 7661. [2019-10-02 01:35:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7661 states. [2019-10-02 01:35:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7661 states to 7661 states and 9351 transitions. [2019-10-02 01:35:11,929 INFO L78 Accepts]: Start accepts. Automaton has 7661 states and 9351 transitions. Word has length 1001 [2019-10-02 01:35:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:11,931 INFO L475 AbstractCegarLoop]: Abstraction has 7661 states and 9351 transitions. [2019-10-02 01:35:11,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:35:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 7661 states and 9351 transitions. [2019-10-02 01:35:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1009 [2019-10-02 01:35:11,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:11,964 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:35:11,964 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 339957380, now seen corresponding path program 1 times [2019-10-02 01:35:11,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 908 proven. 470 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2019-10-02 01:35:13,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:13,655 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:35:13,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:13,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:35:13,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 1009 proven. 2 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2019-10-02 01:35:14,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:35:14,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:35:14,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:35:14,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:35:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:35:14,843 INFO L87 Difference]: Start difference. First operand 7661 states and 9351 transitions. Second operand 11 states. [2019-10-02 01:35:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:21,917 INFO L93 Difference]: Finished difference Result 18074 states and 22147 transitions. [2019-10-02 01:35:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:35:21,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1008 [2019-10-02 01:35:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:21,965 INFO L225 Difference]: With dead ends: 18074 [2019-10-02 01:35:21,965 INFO L226 Difference]: Without dead ends: 10758 [2019-10-02 01:35:21,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 1018 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:35:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2019-10-02 01:35:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 10076. [2019-10-02 01:35:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10076 states. [2019-10-02 01:35:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10076 states to 10076 states and 11544 transitions. [2019-10-02 01:35:22,171 INFO L78 Accepts]: Start accepts. Automaton has 10076 states and 11544 transitions. Word has length 1008 [2019-10-02 01:35:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:22,173 INFO L475 AbstractCegarLoop]: Abstraction has 10076 states and 11544 transitions. [2019-10-02 01:35:22,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:35:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 10076 states and 11544 transitions. [2019-10-02 01:35:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2019-10-02 01:35:22,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:22,212 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:35:22,212 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:22,213 INFO L82 PathProgramCache]: Analyzing trace with hash 823844325, now seen corresponding path program 1 times [2019-10-02 01:35:22,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:22,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 906 proven. 378 refuted. 0 times theorem prover too weak. 2208 trivial. 0 not checked. [2019-10-02 01:35:25,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:25,680 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:35:25,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:26,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:35:26,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3492 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 3191 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:35:26,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:35:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-02 01:35:26,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:35:26,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:35:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:35:26,683 INFO L87 Difference]: Start difference. First operand 10076 states and 11544 transitions. Second operand 14 states. [2019-10-02 01:35:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:35,470 INFO L93 Difference]: Finished difference Result 19910 states and 22939 transitions. [2019-10-02 01:35:35,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 01:35:35,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1250 [2019-10-02 01:35:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:35,503 INFO L225 Difference]: With dead ends: 19910 [2019-10-02 01:35:35,503 INFO L226 Difference]: Without dead ends: 10179 [2019-10-02 01:35:35,521 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1270 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=388, Invalid=1172, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 01:35:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10179 states. [2019-10-02 01:35:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10179 to 10097. [2019-10-02 01:35:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10097 states. [2019-10-02 01:35:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10097 states to 10097 states and 11228 transitions. [2019-10-02 01:35:35,678 INFO L78 Accepts]: Start accepts. Automaton has 10097 states and 11228 transitions. Word has length 1250 [2019-10-02 01:35:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:35,679 INFO L475 AbstractCegarLoop]: Abstraction has 10097 states and 11228 transitions. [2019-10-02 01:35:35,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:35:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10097 states and 11228 transitions. [2019-10-02 01:35:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2019-10-02 01:35:35,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:35,719 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:35:35,719 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash -523164653, now seen corresponding path program 1 times [2019-10-02 01:35:35,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:35,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:35,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 870 proven. 388 refuted. 0 times theorem prover too weak. 2010 trivial. 0 not checked. [2019-10-02 01:35:38,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:38,760 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:35:38,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:39,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1760 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:35:39,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:39,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:35:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3268 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 2639 trivial. 0 not checked. [2019-10-02 01:35:39,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:35:39,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 01:35:39,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:35:39,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:35:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:35:39,863 INFO L87 Difference]: Start difference. First operand 10097 states and 11228 transitions. Second operand 15 states. [2019-10-02 01:35:48,369 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-02 01:35:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:35:52,825 INFO L93 Difference]: Finished difference Result 27842 states and 31375 transitions. [2019-10-02 01:35:52,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-02 01:35:52,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1354 [2019-10-02 01:35:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:35:52,874 INFO L225 Difference]: With dead ends: 27842 [2019-10-02 01:35:52,875 INFO L226 Difference]: Without dead ends: 18090 [2019-10-02 01:35:52,894 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1472 GetRequests, 1395 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1221, Invalid=4941, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 01:35:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18090 states. [2019-10-02 01:35:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18090 to 15645. [2019-10-02 01:35:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15645 states. [2019-10-02 01:35:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15645 states to 15645 states and 17465 transitions. [2019-10-02 01:35:53,186 INFO L78 Accepts]: Start accepts. Automaton has 15645 states and 17465 transitions. Word has length 1354 [2019-10-02 01:35:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:35:53,187 INFO L475 AbstractCegarLoop]: Abstraction has 15645 states and 17465 transitions. [2019-10-02 01:35:53,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:35:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15645 states and 17465 transitions. [2019-10-02 01:35:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2019-10-02 01:35:53,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:35:53,271 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:35:53,271 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:35:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:35:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1408439032, now seen corresponding path program 1 times [2019-10-02 01:35:53,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:35:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:35:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:53,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:35:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5337 backedges. 1783 proven. 1016 refuted. 0 times theorem prover too weak. 2538 trivial. 0 not checked. [2019-10-02 01:35:58,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:35:58,059 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:35:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:35:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:35:58,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 2214 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 01:35:58,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:35:58,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:36:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5337 backedges. 2367 proven. 2 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-10-02 01:36:00,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:00,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 22 [2019-10-02 01:36:00,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 01:36:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 01:36:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:36:00,172 INFO L87 Difference]: Start difference. First operand 15645 states and 17465 transitions. Second operand 22 states. [2019-10-02 01:36:15,134 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 01:36:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:18,002 INFO L93 Difference]: Finished difference Result 33133 states and 37126 transitions. [2019-10-02 01:36:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-02 01:36:18,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1733 [2019-10-02 01:36:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:18,047 INFO L225 Difference]: With dead ends: 33133 [2019-10-02 01:36:18,047 INFO L226 Difference]: Without dead ends: 17494 [2019-10-02 01:36:18,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1850 GetRequests, 1768 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1075, Invalid=5731, Unknown=0, NotChecked=0, Total=6806 [2019-10-02 01:36:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17494 states. [2019-10-02 01:36:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17494 to 17375. [2019-10-02 01:36:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-10-02 01:36:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 19208 transitions. [2019-10-02 01:36:18,372 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 19208 transitions. Word has length 1733 [2019-10-02 01:36:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:18,372 INFO L475 AbstractCegarLoop]: Abstraction has 17375 states and 19208 transitions. [2019-10-02 01:36:18,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 01:36:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 19208 transitions. [2019-10-02 01:36:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1826 [2019-10-02 01:36:18,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:18,438 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:36:18,438 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:18,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1883345135, now seen corresponding path program 1 times [2019-10-02 01:36:18,439 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:18,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:18,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6365 backedges. 924 proven. 676 refuted. 0 times theorem prover too weak. 4765 trivial. 0 not checked. [2019-10-02 01:36:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:20,394 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:36:20,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:20,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 2348 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:36:20,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6365 backedges. 4070 proven. 2 refuted. 0 times theorem prover too weak. 2293 trivial. 0 not checked. [2019-10-02 01:36:22,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:22,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:36:22,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:36:22,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:36:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:36:22,040 INFO L87 Difference]: Start difference. First operand 17375 states and 19208 transitions. Second operand 9 states. [2019-10-02 01:36:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:36:27,151 INFO L93 Difference]: Finished difference Result 33874 states and 37819 transitions. [2019-10-02 01:36:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:36:27,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1825 [2019-10-02 01:36:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:36:27,198 INFO L225 Difference]: With dead ends: 33874 [2019-10-02 01:36:27,198 INFO L226 Difference]: Without dead ends: 18200 [2019-10-02 01:36:27,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1848 GetRequests, 1832 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:36:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18200 states. [2019-10-02 01:36:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18200 to 16363. [2019-10-02 01:36:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16363 states. [2019-10-02 01:36:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16363 states to 16363 states and 17766 transitions. [2019-10-02 01:36:27,564 INFO L78 Accepts]: Start accepts. Automaton has 16363 states and 17766 transitions. Word has length 1825 [2019-10-02 01:36:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:36:27,566 INFO L475 AbstractCegarLoop]: Abstraction has 16363 states and 17766 transitions. [2019-10-02 01:36:27,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:36:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16363 states and 17766 transitions. [2019-10-02 01:36:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1884 [2019-10-02 01:36:27,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:36:27,641 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:36:27,642 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:36:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:36:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1427515859, now seen corresponding path program 1 times [2019-10-02 01:36:27,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:36:27,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:36:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:27,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:27,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:36:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6783 backedges. 1479 proven. 432 refuted. 0 times theorem prover too weak. 4872 trivial. 0 not checked. [2019-10-02 01:36:31,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:36:31,636 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:36:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:36:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:36:32,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 2407 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 01:36:32,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:36:32,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:36:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6783 backedges. 4759 proven. 6 refuted. 0 times theorem prover too weak. 2018 trivial. 0 not checked. [2019-10-02 01:36:33,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:36:33,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-10-02 01:36:33,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 01:36:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 01:36:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:36:33,611 INFO L87 Difference]: Start difference. First operand 16363 states and 17766 transitions. Second operand 19 states. [2019-10-02 01:36:42,915 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-10-02 01:37:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:37:01,491 INFO L93 Difference]: Finished difference Result 40408 states and 45025 transitions. [2019-10-02 01:37:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-02 01:37:01,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1883 [2019-10-02 01:37:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:37:01,495 INFO L225 Difference]: With dead ends: 40408 [2019-10-02 01:37:01,495 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:37:01,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2060 GetRequests, 1956 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3885 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1657, Invalid=9473, Unknown=0, NotChecked=0, Total=11130 [2019-10-02 01:37:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:37:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:37:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:37:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:37:01,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1883 [2019-10-02 01:37:01,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:37:01,547 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:37:01,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 01:37:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:37:01,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:37:01,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:37:04,394 WARN L191 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 483 DAG size of output: 459 [2019-10-02 01:37:07,931 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 483 DAG size of output: 459 [2019-10-02 01:37:14,700 WARN L191 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 469 DAG size of output: 88 [2019-10-02 01:37:17,915 WARN L191 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 363 DAG size of output: 101 [2019-10-02 01:37:21,046 WARN L191 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 365 DAG size of output: 101 [2019-10-02 01:37:24,295 WARN L191 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 406 DAG size of output: 135 [2019-10-02 01:37:31,053 WARN L191 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 469 DAG size of output: 88 [2019-10-02 01:37:31,055 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:37:31,055 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,056 INFO L443 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,057 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,058 INFO L443 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,059 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,059 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,059 INFO L443 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1494 1765) the Hoare annotation is: (let ((.cse20 (= ~a12~0 6)) (.cse25 (not (= 3 |old(~a15~0)|))) (.cse27 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse28 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse24 (= ~a12~0 |old(~a12~0)|)) (.cse26 (<= ~a12~0 7)) (.cse13 (= ~a16~0 |old(~a16~0)|)) (.cse14 (= ~a18~0 |old(~a18~0)|)) (.cse16 (= ~a15~0 |old(~a15~0)|)) (.cse10 (= 12 |old(~a16~0)|)) (.cse3 (= 4 |old(~a15~0)|)) (.cse6 (not (<= |old(~a12~0)| 7))) (.cse1 (= 6 |old(~a12~0)|))) (let ((.cse9 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse21 (not .cse1)) (.cse8 (or .cse10 .cse3 .cse6)) (.cse7 (and (and .cse24 (not (= 12 ~a16~0)) .cse26 (not (= 4 ~a15~0))) .cse13 .cse14 .cse16)) (.cse17 (and (or .cse25 .cse27) .cse28)) (.cse15 (= ~a12~0 9)) (.cse22 (and .cse27 .cse28)) (.cse11 (not (= 9 |old(~a12~0)|))) (.cse2 (= 9 |old(~a16~0)|)) (.cse23 (not (<= |old(~a12~0)| 5))) (.cse19 (not (= 8 |old(~a12~0)|))) (.cse18 (and .cse13 (= ~a12~0 8) .cse14 .cse16)) (.cse4 (not (<= 6 |old(~a12~0)|))) (.cse5 (= 10 |old(~a16~0)|)) (.cse12 (not (<= 4 |old(~a15~0)|))) (.cse0 (and (not .cse20) .cse16 .cse13 .cse14 .cse26 (<= 6 ~a12~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9) (or .cse10 .cse5 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16)) (or .cse2 .cse3 (and .cse13 .cse14 .cse15) .cse17 .cse11) (or (not (= 5 |old(~a12~0)|)) (and (= ~a12~0 5) .cse16 .cse13 .cse14) (not .cse2)) (or .cse18 .cse10 .cse19 .cse5) (or (and .cse16 .cse13 .cse14 .cse20) .cse3 .cse21 .cse17) (or .cse2 .cse3 .cse16 .cse22 .cse9 .cse11) (or .cse10 (and .cse13 .cse14 .cse16 .cse20) .cse21) (or (or .cse3 .cse23) (and .cse13 .cse24 .cse14 .cse16)) (or .cse8 .cse7 .cse17) (or .cse25 (and .cse16 .cse13 .cse14 .cse15) .cse22 .cse11) (or .cse10 .cse2 (and .cse24 .cse16 .cse13 .cse14) .cse23) (or .cse3 .cse19 .cse18) (or .cse1 .cse10 .cse4 .cse5 .cse6 .cse12 .cse0)))) [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,060 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1494 1765) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,061 INFO L443 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,062 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,063 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:37:31,064 INFO L443 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,064 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:37:31,064 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:37:31,064 INFO L439 ceAbstractionStarter]: At program point L1491(line 1491) the Hoare annotation is: (let ((.cse30 (not (= 3 |old(~a15~0)|))) (.cse32 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse33 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse16 (= 12 |old(~a16~0)|)) (.cse4 (= 4 |old(~a15~0)|)) (.cse15 (not (<= |old(~a12~0)| 7))) (.cse2 (= ~a12~0 |old(~a12~0)|)) (.cse10 (<= ~a12~0 7)) (.cse35 (not (= 7 |old(~a12~0)|))) (.cse36 (not (= 3 calculate_output_~input))) (.cse34 (< 0 (+ ~a18~0 79))) (.cse12 (= 9 |old(~a16~0)|)) (.cse20 (= ~a12~0 9)) (.cse8 (= 6 |old(~a12~0)|)) (.cse1 (= ~a15~0 |old(~a15~0)|)) (.cse3 (= ~a16~0 |old(~a16~0)|)) (.cse0 (= ~a18~0 |old(~a18~0)|)) (.cse37 (= ~a12~0 6))) (let ((.cse23 (and .cse1 .cse3 .cse0 .cse37)) (.cse24 (not .cse8)) (.cse29 (and .cse1 .cse3 (= ~a12~0 8) .cse0)) (.cse28 (not (= 8 |old(~a12~0)|))) (.cse31 (and .cse1 .cse3 .cse0 .cse20)) (.cse21 (not (= 9 |old(~a12~0)|))) (.cse5 (not (<= |old(~a12~0)| 5))) (.cse13 (not (<= 6 |old(~a12~0)|))) (.cse9 (not .cse37)) (.cse17 (not (= ~a16~0 8))) (.cse18 (not (= ~a15~0 4))) (.cse11 (<= 6 ~a12~0)) (.cse14 (= 10 |old(~a16~0)|)) (.cse22 (not (<= 4 |old(~a15~0)|))) (.cse19 (not (= calculate_output_~input 4))) (.cse26 (not (= 5 |old(~a12~0)|))) (.cse27 (not .cse12)) (.cse7 (and .cse3 (and .cse2 (not (= 12 ~a16~0)) .cse10 (or (not (= ~a16~0 11)) .cse35 .cse36 (not (= ~a15~0 3)) .cse34) (not (= 4 ~a15~0))) .cse0 .cse1)) (.cse6 (or .cse16 .cse4 .cse15)) (.cse25 (and (or .cse30 .cse32) .cse33))) (and (or (and .cse0 .cse1 (and .cse2 .cse3)) (or .cse4 .cse5)) (or .cse6 (not (<= (+ |old(~a18~0)| 87) 0)) .cse7) (or .cse8 (and .cse9 .cse1 .cse3 .cse0 .cse10 .cse11) .cse12 .cse4 .cse13 .cse14 .cse15) (or .cse16 (and (or .cse17 .cse18 .cse19) .cse1 .cse3 .cse0 .cse20) .cse14 .cse21 .cse22) (or .cse4 .cse23 .cse24 .cse25) (or .cse26 (and (= ~a12~0 5) .cse1 .cse3 .cse0) .cse27) (or .cse16 .cse23 .cse24) (or .cse4 .cse28 .cse29) (or .cse30 .cse31 (and .cse32 .cse33) .cse21) (or .cse16 .cse29 .cse28 .cse14) (or .cse12 .cse31 .cse4 .cse25 .cse21) (or .cse16 .cse12 (and .cse2 .cse1 .cse3 .cse0) .cse5) (or .cse8 .cse16 .cse13 (and .cse9 .cse1 .cse3 (or .cse17 .cse18 .cse19 (< 134 ~a18~0)) .cse0 .cse10 .cse11) .cse14 .cse15 .cse22) (or (not .cse4) (not (= 8 |old(~a16~0)|)) .cse26 .cse19) (or .cse30 .cse26 (or (<= (+ ~a18~0 156) 0) .cse34) .cse27) (or .cse7 .cse6 .cse25) (or .cse30 .cse35 (or .cse36 .cse34) (not (= 11 |old(~a16~0)|)))))) [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L1491-1(line 1491) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:37:31,065 INFO L443 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,066 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,067 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,068 INFO L443 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:37:31,069 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,070 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:37:31,071 INFO L443 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,072 INFO L443 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:37:31,073 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,074 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,075 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,076 INFO L443 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,077 INFO L443 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,078 INFO L443 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,078 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,078 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1492) the Hoare annotation is: (let ((.cse20 (= ~a12~0 6)) (.cse25 (not (= 3 |old(~a15~0)|))) (.cse27 (not (< 0 (+ |old(~a18~0)| 79)))) (.cse28 (not (<= (+ |old(~a18~0)| 156) 0))) (.cse24 (= ~a12~0 |old(~a12~0)|)) (.cse26 (<= ~a12~0 7)) (.cse13 (= ~a16~0 |old(~a16~0)|)) (.cse14 (= ~a18~0 |old(~a18~0)|)) (.cse16 (= ~a15~0 |old(~a15~0)|)) (.cse10 (= 12 |old(~a16~0)|)) (.cse3 (= 4 |old(~a15~0)|)) (.cse6 (not (<= |old(~a12~0)| 7))) (.cse1 (= 6 |old(~a12~0)|))) (let ((.cse9 (not (<= (+ |old(~a18~0)| 87) 0))) (.cse21 (not .cse1)) (.cse8 (or .cse10 .cse3 .cse6)) (.cse7 (and (and .cse24 (not (= 12 ~a16~0)) .cse26 (not (= 4 ~a15~0))) .cse13 .cse14 .cse16)) (.cse17 (and (or .cse25 .cse27) .cse28)) (.cse15 (= ~a12~0 9)) (.cse22 (and .cse27 .cse28)) (.cse11 (not (= 9 |old(~a12~0)|))) (.cse2 (= 9 |old(~a16~0)|)) (.cse23 (not (<= |old(~a12~0)| 5))) (.cse19 (not (= 8 |old(~a12~0)|))) (.cse18 (and .cse13 (= ~a12~0 8) .cse14 .cse16)) (.cse4 (not (<= 6 |old(~a12~0)|))) (.cse5 (= 10 |old(~a16~0)|)) (.cse12 (not (<= 4 |old(~a15~0)|))) (.cse0 (and (not .cse20) .cse16 .cse13 .cse14 .cse26 (<= 6 ~a12~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9) (or .cse10 .cse5 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16)) (or .cse2 .cse3 (and .cse13 .cse14 .cse15) .cse17 .cse11) (or (not (= 5 |old(~a12~0)|)) (and (= ~a12~0 5) .cse16 .cse13 .cse14) (not .cse2)) (or .cse18 .cse10 .cse19 .cse5) (or (and .cse16 .cse13 .cse14 .cse20) .cse3 .cse21 .cse17) (or .cse2 .cse3 .cse16 .cse22 .cse9 .cse11) (or .cse10 (and .cse13 .cse14 .cse16 .cse20) .cse21) (or (or .cse3 .cse23) (and .cse13 .cse24 .cse14 .cse16)) (or .cse8 .cse7 .cse17) (or .cse25 (and .cse16 .cse13 .cse14 .cse15) .cse22 .cse11) (or .cse10 .cse2 (and .cse24 .cse16 .cse13 .cse14) .cse23) (or .cse3 .cse19 .cse18) (or .cse1 .cse10 .cse4 .cse5 .cse6 .cse12 .cse0)))) [2019-10-02 01:37:31,078 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,078 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:37:31,079 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,080 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:37:31,081 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,082 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,083 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,084 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,085 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:37:31,086 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,087 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,088 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:37:31,089 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,090 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,091 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:37:31,092 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,093 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,094 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,095 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,096 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,097 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,098 INFO L443 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,099 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,100 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-10-02 01:37:31,101 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:37:31,101 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 9)) (not (= 12 ~a16~0)) (<= ~a12~0 5) (not (= 10 ~a16~0)) (= (+ ~a18~0 87) 0) (not (= 4 ~a15~0))) [2019-10-02 01:37:31,101 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:37:31,101 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:37:31,101 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1767 1783) the Hoare annotation is: (or (= 12 |old(~a16~0)|) (= 9 |old(~a16~0)|) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a18~0 |old(~a18~0)|)) (= 4 |old(~a15~0)|) (not (= (+ |old(~a18~0)| 87) 0)) (not (<= |old(~a12~0)| 5)) (= 10 |old(~a16~0)|)) [2019-10-02 01:37:31,101 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:37:31,102 INFO L439 ceAbstractionStarter]: At program point L1781(line 1781) the Hoare annotation is: (let ((.cse2 (not (= 12 ~a16~0))) (.cse11 (<= ~a12~0 7)) (.cse7 (not (= 4 ~a15~0))) (.cse13 (<= (+ ~a18~0 156) 0)) (.cse12 (= ~a15~0 3)) (.cse14 (< 0 (+ ~a18~0 79)))) (let ((.cse1 (<= 4 ~a15~0)) (.cse4 (= ~a12~0 9)) (.cse6 (<= ~a12~0 5)) (.cse5 (= ~a12~0 8)) (.cse16 (not (= ~a16~0 9))) (.cse3 (not (= 10 ~a16~0))) (.cse8 (or .cse13 (and .cse12 .cse14))) (.cse10 (= ~a12~0 6)) (.cse15 (<= (+ ~a18~0 87) 0)) (.cse0 (= 5 |old(~a12~0)|)) (.cse9 (and .cse2 .cse11 (or (not (= 3 |old(~a15~0)|)) (not (= 7 |old(~a12~0)|)) (not (= 11 |old(~a16~0)|))) .cse7))) (or (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~a12~0 5) (and .cse0 .cse2)) (and .cse0 .cse2 .cse5 .cse3) (not (<= |old(~a12~0)| 5)) (and .cse0 .cse6 .cse7) (and .cse8 (and .cse0 .cse9)) (= 10 |old(~a16~0)|) (and .cse0 .cse2 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 (<= 6 ~a12~0)) (and .cse12 (or .cse13 .cse14) .cse0 .cse4) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) .cse15 (= ~a16~0 |old(~a16~0)|)) (and .cse8 .cse0 .cse16 .cse4 .cse7) (= 9 |old(~a16~0)|) (= 4 |old(~a15~0)|) (and .cse0 .cse16 .cse2 .cse6) (and .cse0 .cse5 .cse7) (and .cse0 (not .cse10) .cse16 .cse11 .cse3 .cse7) (= 12 |old(~a16~0)|) (and .cse8 .cse0 .cse7 .cse10) (and .cse15 .cse0 .cse9)))) [2019-10-02 01:37:31,102 INFO L443 ceAbstractionStarter]: For program point L1781-1(line 1781) no Hoare annotation was computed. [2019-10-02 01:37:31,102 INFO L443 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-10-02 01:37:31,102 INFO L439 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse2 (not (= 12 ~a16~0))) (.cse11 (<= ~a12~0 7)) (.cse7 (not (= 4 ~a15~0))) (.cse13 (<= (+ ~a18~0 156) 0)) (.cse12 (= ~a15~0 3)) (.cse14 (< 0 (+ ~a18~0 79)))) (let ((.cse1 (<= 4 ~a15~0)) (.cse4 (= ~a12~0 9)) (.cse6 (<= ~a12~0 5)) (.cse5 (= ~a12~0 8)) (.cse16 (not (= ~a16~0 9))) (.cse3 (not (= 10 ~a16~0))) (.cse8 (or .cse13 (and .cse12 .cse14))) (.cse10 (= ~a12~0 6)) (.cse15 (<= (+ ~a18~0 87) 0)) (.cse0 (= 5 |old(~a12~0)|)) (.cse9 (and .cse2 .cse11 (or (not (= 3 |old(~a15~0)|)) (not (= 7 |old(~a12~0)|)) (not (= 11 |old(~a16~0)|))) .cse7))) (or (not (= (+ |old(~a18~0)| 87) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~a12~0 5) (and .cse0 .cse2)) (and .cse0 .cse2 .cse5 .cse3) (not (<= |old(~a12~0)| 5)) (and .cse0 .cse6 .cse7) (and .cse8 (and .cse0 .cse9)) (= 10 |old(~a16~0)|) (and .cse0 .cse2 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 (<= 6 ~a12~0)) (and .cse12 (or .cse13 .cse14) .cse0 .cse4) (and (= ~a12~0 |old(~a12~0)|) (= ~a15~0 |old(~a15~0)|) .cse15 (= ~a16~0 |old(~a16~0)|)) (and .cse8 .cse0 .cse16 .cse4 .cse7) (= 9 |old(~a16~0)|) (= 4 |old(~a15~0)|) (and .cse0 .cse16 .cse2 .cse6) (and .cse0 .cse5 .cse7) (and .cse0 (not .cse10) .cse16 .cse11 .cse3 .cse7) (= 12 |old(~a16~0)|) (and .cse8 .cse0 .cse7 .cse10) (and .cse15 .cse0 .cse9)))) [2019-10-02 01:37:31,102 INFO L443 ceAbstractionStarter]: For program point L1773-3(lines 1767 1783) no Hoare annotation was computed. [2019-10-02 01:37:31,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:37:31 BoogieIcfgContainer [2019-10-02 01:37:31,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:37:31,128 INFO L168 Benchmark]: Toolchain (without parser) took 175415.02 ms. Allocated memory was 135.3 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 86.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:37:31,129 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:37:31,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1204.11 ms. Allocated memory was 135.3 MB in the beginning and 203.9 MB in the end (delta: 68.7 MB). Free memory was 86.2 MB in the beginning and 122.9 MB in the end (delta: -36.7 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:37:31,131 INFO L168 Benchmark]: Boogie Preprocessor took 193.20 ms. Allocated memory is still 203.9 MB. Free memory was 122.9 MB in the beginning and 112.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-10-02 01:37:31,132 INFO L168 Benchmark]: RCFGBuilder took 2561.42 ms. Allocated memory was 203.9 MB in the beginning and 264.2 MB in the end (delta: 60.3 MB). Free memory was 112.4 MB in the beginning and 126.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:37:31,132 INFO L168 Benchmark]: TraceAbstraction took 171451.84 ms. Allocated memory was 264.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 126.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:37:31,137 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.24 ms. Allocated memory is still 135.3 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1204.11 ms. Allocated memory was 135.3 MB in the beginning and 203.9 MB in the end (delta: 68.7 MB). Free memory was 86.2 MB in the beginning and 122.9 MB in the end (delta: -36.7 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 193.20 ms. Allocated memory is still 203.9 MB. Free memory was 122.9 MB in the beginning and 112.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2561.42 ms. Allocated memory was 203.9 MB in the beginning and 264.2 MB in the end (delta: 60.3 MB). Free memory was 112.4 MB in the beginning and 126.6 MB in the end (delta: -14.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 171451.84 ms. Allocated memory was 264.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 126.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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: 1773]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(a18) + 87 == 0) || ((((5 == \old(a12) && 4 <= a15) && !(12 == a16)) && !(10 == a16)) && a12 == 9)) || (a12 == 5 && 5 == \old(a12) && !(12 == a16))) || (((5 == \old(a12) && !(12 == a16)) && a12 == 8) && !(10 == a16))) || !(\old(a12) <= 5)) || ((5 == \old(a12) && a12 <= 5) && !(4 == a15))) || ((a18 + 156 <= 0 || (a15 == 3 && 0 < a18 + 79)) && 5 == \old(a12) && ((!(12 == a16) && a12 <= 7) && ((!(3 == \old(a15)) || !(7 == \old(a12))) || !(11 == \old(a16)))) && !(4 == a15))) || 10 == \old(a16)) || ((5 == \old(a12) && !(12 == a16)) && a12 == 6)) || (((((5 == \old(a12) && 4 <= a15) && !(12 == a16)) && a12 <= 7) && !(10 == a16)) && 6 <= a12)) || (((a15 == 3 && (a18 + 156 <= 0 || 0 < a18 + 79)) && 5 == \old(a12)) && a12 == 9)) || (((a12 == \old(a12) && a15 == \old(a15)) && a18 + 87 <= 0) && a16 == \old(a16))) || (((((a18 + 156 <= 0 || (a15 == 3 && 0 < a18 + 79)) && 5 == \old(a12)) && !(a16 == 9)) && a12 == 9) && !(4 == a15))) || 9 == \old(a16)) || 4 == \old(a15)) || (((5 == \old(a12) && !(a16 == 9)) && !(12 == a16)) && a12 <= 5)) || ((5 == \old(a12) && a12 == 8) && !(4 == a15))) || (((((5 == \old(a12) && !(a12 == 6)) && !(a16 == 9)) && a12 <= 7) && !(10 == a16)) && !(4 == a15))) || 12 == \old(a16)) || ((((a18 + 156 <= 0 || (a15 == 3 && 0 < a18 + 79)) && 5 == \old(a12)) && !(4 == a15)) && a12 == 6)) || ((a18 + 87 <= 0 && 5 == \old(a12)) && ((!(12 == a16) && a12 <= 7) && ((!(3 == \old(a15)) || !(7 == \old(a12))) || !(11 == \old(a16)))) && !(4 == a15)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 409 locations, 1 error locations. SAFE Result, 171.3s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 106.0s AutomataDifference, 0.0s DeadEndRemovalTime, 29.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 789 SDtfs, 36953 SDslu, 3079 SDs, 0 SdLazy, 77971 SolverSat, 15406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11600 GetRequests, 11164 SyntacticMatches, 8 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9183 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17375occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 6671 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 1169 PreInvPairs, 1670 NumberOfFragments, 2315 HoareAnnotationTreeSize, 1169 FomulaSimplifications, 14351913 FormulaSimplificationTreeSizeReduction, 6.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1448410 FormulaSimplificationTreeSizeReductionInter, 23.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 22193 NumberOfCodeBlocks, 22193 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 22172 ConstructedInterpolants, 0 QuantifiedInterpolants, 86903648 SizeOfPredicates, 5 NumberOfNonLiveVariables, 14466 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 57868/61820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...