java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 17:14:18,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 17:14:18,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 17:14:18,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 17:14:18,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 17:14:18,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 17:14:18,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 17:14:18,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 17:14:18,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 17:14:18,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 17:14:18,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 17:14:18,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 17:14:18,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 17:14:18,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 17:14:18,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 17:14:18,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 17:14:18,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 17:14:18,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 17:14:18,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 17:14:18,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 17:14:18,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 17:14:18,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 17:14:18,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 17:14:18,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 17:14:18,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 17:14:18,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 17:14:18,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 17:14:18,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 17:14:18,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 17:14:18,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 17:14:18,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 17:14:18,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 17:14:18,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 17:14:18,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 17:14:18,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 17:14:18,712 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 17:14:18,713 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 17:14:18,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 17:14:18,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 17:14:18,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 17:14:18,743 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 17:14:18,743 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 17:14:18,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 17:14:18,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 17:14:18,745 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 17:14:18,745 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 17:14:18,745 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 17:14:18,745 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 17:14:18,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 17:14:18,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 17:14:18,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 17:14:18,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 17:14:18,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 17:14:18,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 17:14:18,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 17:14:18,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 17:14:18,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 17:14:18,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 17:14:18,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 17:14:18,750 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 17:14:18,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 17:14:18,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 17:14:18,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 17:14:18,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 17:14:18,751 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 17:14:18,751 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 17:14:18,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 17:14:18,751 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 17:14:18,751 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 17:14:18,751 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 17:14:18,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 17:14:18,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 17:14:18,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 17:14:18,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 17:14:18,821 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 17:14:18,821 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-09-14 17:14:19,154 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869020ad6/2cbd30e5a8af404f8447d9fafdd5749e/FLAG52630be8b [2018-09-14 17:14:19,458 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 17:14:19,459 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-09-14 17:14:19,489 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869020ad6/2cbd30e5a8af404f8447d9fafdd5749e/FLAG52630be8b [2018-09-14 17:14:19,510 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/869020ad6/2cbd30e5a8af404f8447d9fafdd5749e [2018-09-14 17:14:19,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 17:14:19,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 17:14:19,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 17:14:19,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 17:14:19,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 17:14:19,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:14:19" (1/1) ... [2018-09-14 17:14:19,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d9d9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:19, skipping insertion in model container [2018-09-14 17:14:19,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 05:14:19" (1/1) ... [2018-09-14 17:14:19,552 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 17:14:20,279 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:14:20,297 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 17:14:20,460 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 17:14:20,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20 WrapperNode [2018-09-14 17:14:20,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 17:14:20,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 17:14:20,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 17:14:20,538 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 17:14:20,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:20,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:20,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 17:14:20,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 17:14:20,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 17:14:20,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 17:14:20,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:20,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:20,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:20,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:21,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:21,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:21,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (1/1) ... [2018-09-14 17:14:21,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 17:14:21,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 17:14:21,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 17:14:21,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 17:14:21,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (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 [2018-09-14 17:14:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 17:14:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 17:14:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 17:14:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 17:14:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 17:14:21,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 17:14:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 17:14:21,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 17:14:25,942 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 17:14:25,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:14:25 BoogieIcfgContainer [2018-09-14 17:14:25,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 17:14:25,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 17:14:25,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 17:14:25,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 17:14:25,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 05:14:19" (1/3) ... [2018-09-14 17:14:25,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75490418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:14:25, skipping insertion in model container [2018-09-14 17:14:25,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 05:14:20" (2/3) ... [2018-09-14 17:14:25,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75490418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 05:14:25, skipping insertion in model container [2018-09-14 17:14:25,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 05:14:25" (3/3) ... [2018-09-14 17:14:25,952 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44_true-unreach-call.c [2018-09-14 17:14:25,962 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 17:14:25,972 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 17:14:26,026 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 17:14:26,027 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 17:14:26,028 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 17:14:26,028 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 17:14:26,028 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 17:14:26,028 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 17:14:26,029 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 17:14:26,029 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 17:14:26,029 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 17:14:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-09-14 17:14:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-14 17:14:26,075 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:26,076 INFO L376 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] [2018-09-14 17:14:26,077 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:26,083 INFO L82 PathProgramCache]: Analyzing trace with hash -889068935, now seen corresponding path program 1 times [2018-09-14 17:14:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:26,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:26,134 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:26,563 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-09-14 17:14:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:26,575 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:14:26,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:14:26,575 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:14:26,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:14:26,599 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:14:26,599 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:14:26,602 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 4 states. [2018-09-14 17:14:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:14:30,171 INFO L93 Difference]: Finished difference Result 979 states and 1754 transitions. [2018-09-14 17:14:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:14:30,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-09-14 17:14:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:14:30,197 INFO L225 Difference]: With dead ends: 979 [2018-09-14 17:14:30,198 INFO L226 Difference]: Without dead ends: 680 [2018-09-14 17:14:30,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:14:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-09-14 17:14:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 484. [2018-09-14 17:14:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-09-14 17:14:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 730 transitions. [2018-09-14 17:14:30,317 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 730 transitions. Word has length 33 [2018-09-14 17:14:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:14:30,318 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 730 transitions. [2018-09-14 17:14:30,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:14:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 730 transitions. [2018-09-14 17:14:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-14 17:14:30,325 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:30,326 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:14:30,326 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash 337985131, now seen corresponding path program 1 times [2018-09-14 17:14:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:30,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:30,328 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:30,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:14:30,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 17:14:30,719 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:14:30,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 17:14:30,722 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 17:14:30,722 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 17:14:30,722 INFO L87 Difference]: Start difference. First operand 484 states and 730 transitions. Second operand 6 states. [2018-09-14 17:14:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:14:34,869 INFO L93 Difference]: Finished difference Result 1555 states and 2493 transitions. [2018-09-14 17:14:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 17:14:34,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-09-14 17:14:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:14:34,883 INFO L225 Difference]: With dead ends: 1555 [2018-09-14 17:14:34,883 INFO L226 Difference]: Without dead ends: 1077 [2018-09-14 17:14:34,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:14:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-09-14 17:14:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1063. [2018-09-14 17:14:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-09-14 17:14:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1592 transitions. [2018-09-14 17:14:34,954 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1592 transitions. Word has length 106 [2018-09-14 17:14:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:14:34,955 INFO L480 AbstractCegarLoop]: Abstraction has 1063 states and 1592 transitions. [2018-09-14 17:14:34,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 17:14:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1592 transitions. [2018-09-14 17:14:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-14 17:14:34,963 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:34,963 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:14:34,963 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:34,964 INFO L82 PathProgramCache]: Analyzing trace with hash 375100500, now seen corresponding path program 1 times [2018-09-14 17:14:34,964 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:34,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:34,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:34,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:34,965 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:35,521 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:14:35,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-14 17:14:35,522 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:14:35,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 17:14:35,523 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 17:14:35,523 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-14 17:14:35,523 INFO L87 Difference]: Start difference. First operand 1063 states and 1592 transitions. Second operand 7 states. [2018-09-14 17:14:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:14:40,559 INFO L93 Difference]: Finished difference Result 2979 states and 4525 transitions. [2018-09-14 17:14:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 17:14:40,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-09-14 17:14:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:14:40,578 INFO L225 Difference]: With dead ends: 2979 [2018-09-14 17:14:40,578 INFO L226 Difference]: Without dead ends: 1922 [2018-09-14 17:14:40,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:14:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-14 17:14:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1813. [2018-09-14 17:14:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-09-14 17:14:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2564 transitions. [2018-09-14 17:14:40,693 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2564 transitions. Word has length 107 [2018-09-14 17:14:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:14:40,694 INFO L480 AbstractCegarLoop]: Abstraction has 1813 states and 2564 transitions. [2018-09-14 17:14:40,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 17:14:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2564 transitions. [2018-09-14 17:14:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-14 17:14:40,697 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:40,698 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:14:40,698 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1471774269, now seen corresponding path program 1 times [2018-09-14 17:14:40,699 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:40,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:40,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:40,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:40,700 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:41,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:14:41,326 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:14:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:41,340 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:14:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:41,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:14:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:41,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:14:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:41,998 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 17:14:41,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-09-14 17:14:41,999 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:14:41,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:14:42,000 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:14:42,000 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-14 17:14:42,005 INFO L87 Difference]: Start difference. First operand 1813 states and 2564 transitions. Second operand 3 states. [2018-09-14 17:14:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:14:45,254 INFO L93 Difference]: Finished difference Result 4374 states and 6305 transitions. [2018-09-14 17:14:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:14:45,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2018-09-14 17:14:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:14:45,270 INFO L225 Difference]: With dead ends: 4374 [2018-09-14 17:14:45,271 INFO L226 Difference]: Without dead ends: 2567 [2018-09-14 17:14:45,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-14 17:14:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2018-09-14 17:14:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2553. [2018-09-14 17:14:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2018-09-14 17:14:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3443 transitions. [2018-09-14 17:14:45,341 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3443 transitions. Word has length 165 [2018-09-14 17:14:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:14:45,342 INFO L480 AbstractCegarLoop]: Abstraction has 2553 states and 3443 transitions. [2018-09-14 17:14:45,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:14:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3443 transitions. [2018-09-14 17:14:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-14 17:14:45,348 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:45,348 INFO L376 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, 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] [2018-09-14 17:14:45,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -580003924, now seen corresponding path program 1 times [2018-09-14 17:14:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:45,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:45,350 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:45,910 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-09-14 17:14:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:14:46,253 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:14:46,254 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 17:14:46,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:46,270 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:14:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:46,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:14:48,701 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_10 Int)) (let ((.cse2 (* 9 v_prenex_10))) (let ((.cse1 (div .cse2 10))) (let ((.cse0 (mod (+ .cse1 29) 90))) (and (not (= .cse0 0)) (<= (+ c_~a23~0 42) .cse0) (< (+ .cse1 58979) 0) (= 0 (mod .cse2 10)) (<= 0 (+ .cse1 58980)) (<= |c_old(~a23~0)| v_prenex_10)))))) (exists ((v_prenex_13 Int)) (let ((.cse5 (* 9 v_prenex_13))) (let ((.cse4 (div .cse5 10))) (let ((.cse3 (mod (+ .cse4 29) 90))) (and (= .cse3 0) (<= c_~a23~0 (+ .cse3 48)) (<= |c_old(~a23~0)| v_prenex_13) (= 0 (mod (+ .cse4 30) 90)) (<= 0 .cse5)))))) (exists ((v_prenex_25 Int)) (let ((.cse7 (* 9 v_prenex_25))) (let ((.cse6 (div .cse7 10))) (and (not (= (mod (+ .cse6 29) 90) 0)) (< (+ .cse6 58979) 0) (<= |c_old(~a23~0)| v_prenex_25) (<= c_~a23~0 (+ (mod (+ .cse6 30) 90) 48)) (<= 0 (+ .cse6 58980)) (not (= 0 (mod .cse7 10))) (< .cse7 0))))) (exists ((v_prenex_9 Int)) (let ((.cse9 (* 9 v_prenex_9))) (let ((.cse8 (div .cse9 10))) (let ((.cse10 (mod (+ .cse8 30) 90))) (and (not (= (mod (+ .cse8 29) 90) 0)) (<= |c_old(~a23~0)| v_prenex_9) (not (= 0 (mod .cse9 10))) (= 0 .cse10) (< .cse9 0) (<= c_~a23~0 (+ .cse10 48)) (< (+ .cse8 58979) 0)))))) (exists ((v_prenex_17 Int)) (let ((.cse13 (* 9 v_prenex_17))) (let ((.cse11 (div .cse13 10))) (let ((.cse12 (mod (+ .cse11 29) 90))) (and (< (+ .cse11 58979) 0) (<= (+ c_~a23~0 42) .cse12) (<= |c_old(~a23~0)| v_prenex_17) (<= 0 .cse13) (<= 0 (+ .cse11 58980)) (not (= .cse12 0))))))) (exists ((v_prenex_11 Int)) (let ((.cse15 (* 9 v_prenex_11))) (let ((.cse14 (div .cse15 10))) (let ((.cse16 (mod (+ .cse14 30) 90))) (and (<= 0 (+ .cse14 58979)) (not (= 0 (mod .cse15 10))) (<= |c_old(~a23~0)| v_prenex_11) (< .cse15 0) (< (+ .cse14 58980) 0) (not (= 0 .cse16)) (<= (+ c_~a23~0 42) .cse16)))))) (exists ((v_prenex_4 Int)) (let ((.cse19 (* 9 v_prenex_4))) (let ((.cse18 (div .cse19 10))) (let ((.cse17 (mod (+ .cse18 30) 90))) (and (not (= 0 .cse17)) (< (+ .cse18 58980) 0) (< .cse19 0) (not (= 0 (mod .cse19 10))) (<= (+ c_~a23~0 42) .cse17) (= (mod (+ .cse18 29) 90) 0) (<= |c_old(~a23~0)| v_prenex_4)))))) (exists ((v_prenex_22 Int)) (let ((.cse22 (* 9 v_prenex_22))) (let ((.cse21 (div .cse22 10))) (let ((.cse20 (mod (+ .cse21 29) 90))) (and (<= (+ c_~a23~0 42) .cse20) (<= |c_old(~a23~0)| v_prenex_22) (not (= 0 (mod (+ .cse21 30) 90))) (< (+ .cse21 58980) 0) (not (= .cse20 0)) (= 0 (mod .cse22 10)) (< (+ .cse21 58979) 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse24 (* 9 v_prenex_2))) (let ((.cse23 (div .cse24 10))) (and (<= c_~a23~0 (+ (mod (+ .cse23 29) 90) 48)) (<= |c_old(~a23~0)| v_prenex_2) (<= 0 (+ .cse23 58979)) (= 0 (mod .cse24 10)) (<= 0 (+ .cse23 58980)))))) (exists ((v_prenex_1 Int)) (let ((.cse25 (* 9 v_prenex_1))) (let ((.cse26 (div .cse25 10))) (and (= 0 (mod .cse25 10)) (<= c_~a23~0 (+ (mod (+ .cse26 29) 90) 48)) (= 0 (mod (+ .cse26 30) 90)) (<= |c_old(~a23~0)| v_prenex_1) (<= 0 (+ .cse26 58979)))))) (exists ((v_prenex_5 Int)) (let ((.cse29 (* 9 v_prenex_5))) (let ((.cse28 (div .cse29 10))) (let ((.cse27 (mod (+ .cse28 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_5) (<= (+ c_~a23~0 42) .cse27) (= 0 (mod (+ .cse28 30) 90)) (= 0 (mod .cse29 10)) (not (= .cse27 0)) (< (+ .cse28 58979) 0)))))) (exists ((v_prenex_7 Int)) (let ((.cse30 (* 9 v_prenex_7))) (let ((.cse32 (div .cse30 10))) (let ((.cse31 (mod (+ .cse32 29) 90))) (and (<= 0 .cse30) (<= c_~a23~0 (+ .cse31 48)) (<= |c_old(~a23~0)| v_prenex_7) (= .cse31 0) (not (= 0 (mod (+ .cse32 30) 90))) (< (+ .cse32 58980) 0)))))) (exists ((v_prenex_24 Int)) (let ((.cse33 (* 9 v_prenex_24))) (let ((.cse34 (div .cse33 10))) (let ((.cse35 (mod (+ .cse34 30) 90))) (and (not (= 0 (mod .cse33 10))) (not (= (mod (+ .cse34 29) 90) 0)) (<= |c_old(~a23~0)| v_prenex_24) (< (+ .cse34 58979) 0) (< (+ .cse34 58980) 0) (<= (+ c_~a23~0 42) .cse35) (< .cse33 0) (not (= 0 .cse35))))))) (exists ((v_prenex_18 Int)) (let ((.cse36 (* 9 v_prenex_18))) (let ((.cse37 (div .cse36 10))) (let ((.cse38 (mod (+ .cse37 30) 90))) (and (not (= 0 (mod .cse36 10))) (= (mod (+ .cse37 29) 90) 0) (< .cse36 0) (<= |c_old(~a23~0)| v_prenex_18) (<= c_~a23~0 (+ .cse38 48)) (= 0 .cse38)))))) (exists ((v_prenex_6 Int)) (let ((.cse39 (* 9 v_prenex_6))) (let ((.cse40 (div .cse39 10))) (let ((.cse41 (mod (+ .cse40 30) 90))) (and (< .cse39 0) (<= 0 (+ .cse40 58979)) (not (= 0 (mod .cse39 10))) (= 0 .cse41) (<= c_~a23~0 (+ .cse41 48)) (<= |c_old(~a23~0)| v_prenex_6)))))) (exists ((v_prenex_14 Int)) (let ((.cse43 (* 9 v_prenex_14))) (let ((.cse44 (div .cse43 10))) (let ((.cse42 (mod (+ .cse44 29) 90))) (and (= .cse42 0) (<= |c_old(~a23~0)| v_prenex_14) (= 0 (mod .cse43 10)) (<= c_~a23~0 (+ .cse42 48)) (= 0 (mod (+ .cse44 30) 90))))))) (exists ((v_prenex_15 Int)) (let ((.cse47 (* 9 v_prenex_15))) (let ((.cse46 (div .cse47 10))) (let ((.cse45 (mod (+ .cse46 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_15) (<= (+ c_~a23~0 42) .cse45) (= 0 (mod (+ .cse46 30) 90)) (< (+ .cse46 58979) 0) (not (= .cse45 0)) (<= 0 .cse47)))))) (exists ((v_prenex_3 Int)) (let ((.cse49 (* 9 v_prenex_3))) (let ((.cse48 (div .cse49 10))) (and (not (= 0 (mod (+ .cse48 30) 90))) (= 0 (mod .cse49 10)) (<= 0 (+ .cse48 58979)) (< (+ .cse48 58980) 0) (<= c_~a23~0 (+ (mod (+ .cse48 29) 90) 48)) (<= |c_old(~a23~0)| v_prenex_3))))) (exists ((v_prenex_26 Int)) (let ((.cse51 (* 9 v_prenex_26))) (let ((.cse50 (div .cse51 10))) (and (<= |c_old(~a23~0)| v_prenex_26) (= (mod (+ .cse50 29) 90) 0) (<= c_~a23~0 (+ (mod (+ .cse50 30) 90) 48)) (not (= 0 (mod .cse51 10))) (<= 0 (+ .cse50 58980)) (< .cse51 0))))) (exists ((v_prenex_12 Int)) (let ((.cse53 (* 9 v_prenex_12))) (let ((.cse52 (div .cse53 10))) (and (<= |c_old(~a23~0)| v_prenex_12) (not (= 0 (mod (+ .cse52 30) 90))) (<= c_~a23~0 (+ (mod (+ .cse52 29) 90) 48)) (< (+ .cse52 58980) 0) (<= 0 (+ .cse52 58979)) (<= 0 .cse53))))) (exists ((v_prenex_21 Int)) (let ((.cse55 (* 9 v_prenex_21))) (let ((.cse54 (div .cse55 10))) (and (<= 0 (+ .cse54 58979)) (<= |c_old(~a23~0)| v_prenex_21) (<= c_~a23~0 (+ (mod (+ .cse54 29) 90) 48)) (<= 0 .cse55) (<= 0 (+ .cse54 58980)))))) (exists ((v_prenex_23 Int)) (let ((.cse57 (* 9 v_prenex_23))) (let ((.cse56 (div .cse57 10))) (and (= 0 (mod (+ .cse56 30) 90)) (<= |c_old(~a23~0)| v_prenex_23) (<= 0 (+ .cse56 58979)) (<= 0 .cse57) (<= c_~a23~0 (+ (mod (+ .cse56 29) 90) 48)))))) (exists ((v_prenex_16 Int)) (let ((.cse58 (* 9 v_prenex_16))) (let ((.cse59 (div .cse58 10))) (and (<= |c_old(~a23~0)| v_prenex_16) (not (= 0 (mod .cse58 10))) (<= 0 (+ .cse59 58980)) (<= 0 (+ .cse59 58979)) (<= c_~a23~0 (+ (mod (+ .cse59 30) 90) 48)) (< .cse58 0))))) (exists ((v_prenex_20 Int)) (let ((.cse62 (* 9 v_prenex_20))) (let ((.cse61 (div .cse62 10))) (let ((.cse60 (mod (+ .cse61 29) 90))) (and (not (= .cse60 0)) (not (= 0 (mod (+ .cse61 30) 90))) (<= (+ c_~a23~0 42) .cse60) (<= 0 .cse62) (<= |c_old(~a23~0)| v_prenex_20) (< (+ .cse61 58980) 0) (< (+ .cse61 58979) 0)))))) (exists ((v_~a23~0_486 Int)) (let ((.cse64 (* 9 v_~a23~0_486))) (let ((.cse63 (div .cse64 10))) (let ((.cse65 (mod (+ .cse63 29) 90))) (and (< (+ .cse63 58980) 0) (<= |c_old(~a23~0)| v_~a23~0_486) (= 0 (mod .cse64 10)) (not (= 0 (mod (+ .cse63 30) 90))) (<= c_~a23~0 (+ .cse65 48)) (= .cse65 0)))))) (exists ((v_prenex_19 Int)) (let ((.cse68 (* 9 v_prenex_19))) (let ((.cse66 (div .cse68 10))) (let ((.cse67 (mod (+ .cse66 29) 90))) (and (<= 0 (+ .cse66 58980)) (<= c_~a23~0 (+ .cse67 48)) (= 0 (mod .cse68 10)) (= .cse67 0) (<= |c_old(~a23~0)| v_prenex_19)))))) (exists ((v_prenex_8 Int)) (let ((.cse70 (* 9 v_prenex_8))) (let ((.cse69 (div .cse70 10))) (let ((.cse71 (mod (+ .cse69 29) 90))) (and (<= 0 (+ .cse69 58980)) (<= 0 .cse70) (<= |c_old(~a23~0)| v_prenex_8) (= .cse71 0) (<= c_~a23~0 (+ .cse71 48)))))))) is different from true [2018-09-14 17:14:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 71 trivial. 2 not checked. [2018-09-14 17:14:49,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:14:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:14:49,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:14:49,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-09-14 17:14:49,932 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:14:49,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:14:49,933 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:14:49,933 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-09-14 17:14:49,933 INFO L87 Difference]: Start difference. First operand 2553 states and 3443 transitions. Second operand 3 states. [2018-09-14 17:14:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:14:51,544 INFO L93 Difference]: Finished difference Result 6287 states and 8908 transitions. [2018-09-14 17:14:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:14:51,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-09-14 17:14:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:14:51,567 INFO L225 Difference]: With dead ends: 6287 [2018-09-14 17:14:51,568 INFO L226 Difference]: Without dead ends: 3740 [2018-09-14 17:14:51,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 446 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-09-14 17:14:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2018-09-14 17:14:51,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3641. [2018-09-14 17:14:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2018-09-14 17:14:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5008 transitions. [2018-09-14 17:14:51,666 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5008 transitions. Word has length 224 [2018-09-14 17:14:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:14:51,667 INFO L480 AbstractCegarLoop]: Abstraction has 3641 states and 5008 transitions. [2018-09-14 17:14:51,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:14:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5008 transitions. [2018-09-14 17:14:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-14 17:14:51,673 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:51,674 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:14:51,674 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1071646111, now seen corresponding path program 1 times [2018-09-14 17:14:51,674 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:51,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:51,676 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-14 17:14:51,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:14:51,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 17:14:51,917 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:14:51,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 17:14:51,918 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 17:14:51,918 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:14:51,919 INFO L87 Difference]: Start difference. First operand 3641 states and 5008 transitions. Second operand 4 states. [2018-09-14 17:14:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:14:54,552 INFO L93 Difference]: Finished difference Result 9296 states and 13420 transitions. [2018-09-14 17:14:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 17:14:54,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2018-09-14 17:14:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:14:54,596 INFO L225 Difference]: With dead ends: 9296 [2018-09-14 17:14:54,596 INFO L226 Difference]: Without dead ends: 5661 [2018-09-14 17:14:54,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 17:14:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2018-09-14 17:14:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5193. [2018-09-14 17:14:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2018-09-14 17:14:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 7401 transitions. [2018-09-14 17:14:54,758 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 7401 transitions. Word has length 245 [2018-09-14 17:14:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:14:54,758 INFO L480 AbstractCegarLoop]: Abstraction has 5193 states and 7401 transitions. [2018-09-14 17:14:54,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 17:14:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 7401 transitions. [2018-09-14 17:14:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-14 17:14:54,772 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:14:54,772 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:14:54,773 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:14:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash 248780968, now seen corresponding path program 1 times [2018-09-14 17:14:54,773 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:14:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:54,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:14:54,775 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:14:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-09-14 17:14:55,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:14:55,370 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 17:14:55,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:55,379 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:14:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:55,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:14:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:55,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:14:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:56,197 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:14:56,197 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:14:56,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:14:56,226 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:14:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:14:56,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:14:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:56,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:14:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 17:14:56,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:14:56,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 14 [2018-09-14 17:14:56,814 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:14:56,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 17:14:56,815 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 17:14:56,815 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-14 17:14:56,815 INFO L87 Difference]: Start difference. First operand 5193 states and 7401 transitions. Second operand 12 states. [2018-09-14 17:15:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:16,802 INFO L93 Difference]: Finished difference Result 18831 states and 28786 transitions. [2018-09-14 17:15:16,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-14 17:15:16,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 247 [2018-09-14 17:15:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:16,878 INFO L225 Difference]: With dead ends: 18831 [2018-09-14 17:15:16,878 INFO L226 Difference]: Without dead ends: 13644 [2018-09-14 17:15:16,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1013 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2167 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=938, Invalid=5542, Unknown=0, NotChecked=0, Total=6480 [2018-09-14 17:15:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13644 states. [2018-09-14 17:15:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13644 to 12911. [2018-09-14 17:15:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12911 states. [2018-09-14 17:15:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12911 states to 12911 states and 17669 transitions. [2018-09-14 17:15:17,295 INFO L78 Accepts]: Start accepts. Automaton has 12911 states and 17669 transitions. Word has length 247 [2018-09-14 17:15:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:17,295 INFO L480 AbstractCegarLoop]: Abstraction has 12911 states and 17669 transitions. [2018-09-14 17:15:17,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 17:15:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12911 states and 17669 transitions. [2018-09-14 17:15:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-14 17:15:17,308 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:17,309 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:17,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2081573900, now seen corresponding path program 1 times [2018-09-14 17:15:17,309 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:17,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:17,311 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-14 17:15:17,672 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:17,672 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 17:15:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:17,687 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:17,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:23,555 WARN L178 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-09-14 17:15:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-14 17:15:23,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-14 17:15:23,842 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:15:23,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-09-14 17:15:23,842 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:23,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:23,843 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:23,843 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=47, Unknown=2, NotChecked=0, Total=72 [2018-09-14 17:15:23,843 INFO L87 Difference]: Start difference. First operand 12911 states and 17669 transitions. Second operand 3 states. [2018-09-14 17:15:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:25,129 INFO L93 Difference]: Finished difference Result 32993 states and 47504 transitions. [2018-09-14 17:15:25,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:25,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-09-14 17:15:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:25,203 INFO L225 Difference]: With dead ends: 32993 [2018-09-14 17:15:25,204 INFO L226 Difference]: Without dead ends: 20468 [2018-09-14 17:15:25,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 555 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=23, Invalid=47, Unknown=2, NotChecked=0, Total=72 [2018-09-14 17:15:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-09-14 17:15:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 19558. [2018-09-14 17:15:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19558 states. [2018-09-14 17:15:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19558 states to 19558 states and 26162 transitions. [2018-09-14 17:15:25,702 INFO L78 Accepts]: Start accepts. Automaton has 19558 states and 26162 transitions. Word has length 278 [2018-09-14 17:15:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:25,703 INFO L480 AbstractCegarLoop]: Abstraction has 19558 states and 26162 transitions. [2018-09-14 17:15:25,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 19558 states and 26162 transitions. [2018-09-14 17:15:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-14 17:15:25,747 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:25,747 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:25,748 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1525878088, now seen corresponding path program 1 times [2018-09-14 17:15:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:25,750 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:15:26,373 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:26,374 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 17:15:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:26,394 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:26,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:15:26,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:15:27,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:27,364 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:15:27,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:27,380 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:27,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:15:27,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:15:28,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 17:15:28,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 12 [2018-09-14 17:15:28,023 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 17:15:28,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 17:15:28,024 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 17:15:28,025 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-14 17:15:28,025 INFO L87 Difference]: Start difference. First operand 19558 states and 26162 transitions. Second operand 9 states. [2018-09-14 17:15:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:32,317 INFO L93 Difference]: Finished difference Result 40888 states and 57545 transitions. [2018-09-14 17:15:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-14 17:15:32,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 321 [2018-09-14 17:15:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:32,422 INFO L225 Difference]: With dead ends: 40888 [2018-09-14 17:15:32,422 INFO L226 Difference]: Without dead ends: 21716 [2018-09-14 17:15:32,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1283 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2018-09-14 17:15:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21716 states. [2018-09-14 17:15:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21716 to 21022. [2018-09-14 17:15:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21022 states. [2018-09-14 17:15:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21022 states to 21022 states and 26881 transitions. [2018-09-14 17:15:32,942 INFO L78 Accepts]: Start accepts. Automaton has 21022 states and 26881 transitions. Word has length 321 [2018-09-14 17:15:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:32,943 INFO L480 AbstractCegarLoop]: Abstraction has 21022 states and 26881 transitions. [2018-09-14 17:15:32,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 17:15:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 21022 states and 26881 transitions. [2018-09-14 17:15:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-14 17:15:32,971 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:32,971 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:32,971 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash 415462941, now seen corresponding path program 1 times [2018-09-14 17:15:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:32,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:32,973 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 17:15:33,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:33,650 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2018-09-14 17:15:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:33,659 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:33,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 17:15:33,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 17:15:33,994 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:33,994 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 17:15:34,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:34,010 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:34,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-09-14 17:15:34,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2018-09-14 17:15:34,589 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-09-14 17:15:34,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6, 5, 5] total 9 [2018-09-14 17:15:34,590 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:34,591 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:34,591 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:15:34,591 INFO L87 Difference]: Start difference. First operand 21022 states and 26881 transitions. Second operand 3 states. [2018-09-14 17:15:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:37,924 INFO L93 Difference]: Finished difference Result 44097 states and 57225 transitions. [2018-09-14 17:15:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:37,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2018-09-14 17:15:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:38,002 INFO L225 Difference]: With dead ends: 44097 [2018-09-14 17:15:38,002 INFO L226 Difference]: Without dead ends: 25150 [2018-09-14 17:15:38,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1292 GetRequests, 1282 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-09-14 17:15:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25150 states. [2018-09-14 17:15:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25150 to 24637. [2018-09-14 17:15:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24637 states. [2018-09-14 17:15:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24637 states to 24637 states and 31129 transitions. [2018-09-14 17:15:38,454 INFO L78 Accepts]: Start accepts. Automaton has 24637 states and 31129 transitions. Word has length 322 [2018-09-14 17:15:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:38,454 INFO L480 AbstractCegarLoop]: Abstraction has 24637 states and 31129 transitions. [2018-09-14 17:15:38,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 24637 states and 31129 transitions. [2018-09-14 17:15:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-14 17:15:38,516 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:38,516 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:38,517 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1832569915, now seen corresponding path program 1 times [2018-09-14 17:15:38,517 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:38,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:38,518 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 270 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-09-14 17:15:39,194 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:39,194 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:15:39,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:39,205 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:39,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-09-14 17:15:39,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-09-14 17:15:39,716 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 17:15:39,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2018-09-14 17:15:39,717 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:39,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:39,718 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:39,718 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:15:39,718 INFO L87 Difference]: Start difference. First operand 24637 states and 31129 transitions. Second operand 3 states. [2018-09-14 17:15:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:40,781 INFO L93 Difference]: Finished difference Result 46965 states and 59590 transitions. [2018-09-14 17:15:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:40,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2018-09-14 17:15:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:40,832 INFO L225 Difference]: With dead ends: 46965 [2018-09-14 17:15:40,832 INFO L226 Difference]: Without dead ends: 24403 [2018-09-14 17:15:40,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 767 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-14 17:15:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24403 states. [2018-09-14 17:15:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24403 to 24388. [2018-09-14 17:15:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24388 states. [2018-09-14 17:15:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24388 states to 24388 states and 30706 transitions. [2018-09-14 17:15:41,255 INFO L78 Accepts]: Start accepts. Automaton has 24388 states and 30706 transitions. Word has length 384 [2018-09-14 17:15:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:41,256 INFO L480 AbstractCegarLoop]: Abstraction has 24388 states and 30706 transitions. [2018-09-14 17:15:41,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 24388 states and 30706 transitions. [2018-09-14 17:15:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-09-14 17:15:41,294 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:41,294 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:41,294 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:41,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1626784601, now seen corresponding path program 1 times [2018-09-14 17:15:41,295 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:41,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:41,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:41,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:41,296 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-09-14 17:15:41,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 17:15:41,528 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 17:15:41,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:41,538 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 17:15:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:41,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 17:15:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-09-14 17:15:41,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 17:15:42,062 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-09-14 17:15:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 78 proven. 4 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-09-14 17:15:42,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 17:15:42,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-09-14 17:15:42,429 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:42,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:42,430 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:42,430 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:15:42,430 INFO L87 Difference]: Start difference. First operand 24388 states and 30706 transitions. Second operand 3 states. [2018-09-14 17:15:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:43,994 INFO L93 Difference]: Finished difference Result 50489 states and 64880 transitions. [2018-09-14 17:15:43,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:43,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2018-09-14 17:15:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:44,038 INFO L225 Difference]: With dead ends: 50489 [2018-09-14 17:15:44,038 INFO L226 Difference]: Without dead ends: 23643 [2018-09-14 17:15:44,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 797 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:15:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2018-09-14 17:15:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21632. [2018-09-14 17:15:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21632 states. [2018-09-14 17:15:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21632 states to 21632 states and 25704 transitions. [2018-09-14 17:15:44,427 INFO L78 Accepts]: Start accepts. Automaton has 21632 states and 25704 transitions. Word has length 399 [2018-09-14 17:15:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:44,427 INFO L480 AbstractCegarLoop]: Abstraction has 21632 states and 25704 transitions. [2018-09-14 17:15:44,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 21632 states and 25704 transitions. [2018-09-14 17:15:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-14 17:15:44,449 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 17:15:44,449 INFO L376 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 17:15:44,450 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 17:15:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1605144652, now seen corresponding path program 1 times [2018-09-14 17:15:44,450 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 17:15:44,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:44,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 17:15:44,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 17:15:44,451 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 17:15:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 17:15:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-09-14 17:15:44,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 17:15:44,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 17:15:44,739 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 17:15:44,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 17:15:44,739 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 17:15:44,740 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 17:15:44,740 INFO L87 Difference]: Start difference. First operand 21632 states and 25704 transitions. Second operand 3 states. [2018-09-14 17:15:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 17:15:46,188 INFO L93 Difference]: Finished difference Result 47233 states and 56958 transitions. [2018-09-14 17:15:46,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 17:15:46,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2018-09-14 17:15:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 17:15:46,190 INFO L225 Difference]: With dead ends: 47233 [2018-09-14 17:15:46,190 INFO L226 Difference]: Without dead ends: 0 [2018-09-14 17:15:46,248 INFO L604 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 [2018-09-14 17:15:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-14 17:15:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-14 17:15:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-14 17:15:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-14 17:15:46,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 402 [2018-09-14 17:15:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 17:15:46,249 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-14 17:15:46,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 17:15:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-14 17:15:46,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-14 17:15:46,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-14 17:15:46,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,880 WARN L178 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 399 DAG size of output: 105 [2018-09-14 17:15:46,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:46,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-14 17:15:47,210 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 399 DAG size of output: 105 [2018-09-14 17:15:47,566 WARN L178 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-09-14 17:15:47,748 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-09-14 17:15:52,329 WARN L178 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 342 DAG size of output: 52 [2018-09-14 17:15:52,576 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-09-14 17:15:52,805 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2018-09-14 17:15:52,808 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-14 17:15:52,808 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-09-14 17:15:52,809 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-14 17:15:52,809 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-14 17:15:52,809 INFO L426 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-09-14 17:15:52,809 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-14 17:15:52,809 INFO L426 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,809 INFO L426 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-14 17:15:52,810 INFO L426 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,811 INFO L426 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,812 INFO L426 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-09-14 17:15:52,813 INFO L426 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,814 INFO L426 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,815 INFO L426 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,816 INFO L426 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-09-14 17:15:52,817 INFO L426 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,818 INFO L426 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,819 INFO L426 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L422 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse8 (= ~a29~0 |old(~a29~0)|)) (.cse9 (= ~a23~0 |old(~a23~0)|)) (.cse10 (= ~a25~0 |old(~a25~0)|))) (let ((.cse1 (< 140 |old(~a29~0)|)) (.cse5 (< 138 |old(~a23~0)|)) (.cse4 (and .cse8 .cse9 .cse10)) (.cse7 (<= |old(~a29~0)| 245)) (.cse0 (not (= 15 ~a8~0))) (.cse3 (and .cse8 .cse9 (= ~a4~0 1) .cse10)) (.cse2 (not (= 1 |old(~a4~0)|))) (.cse6 (= 9 |old(~a25~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse5) (or .cse0 .cse4 (not (= 12 |old(~a25~0)|))) (or .cse0 .cse4 .cse6 .cse5) (or .cse0 .cse2 .cse5 .cse3) (or (not (= 10 |old(~a25~0)|)) .cse0 .cse1 .cse4) (or .cse0 .cse5 .cse4 .cse7) (or .cse0 (<= |old(~a23~0)| 306) .cse3 .cse2) (or .cse3 .cse0 .cse2 .cse7) (or .cse0 .cse3 .cse2 .cse6)))) [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-09-14 17:15:52,820 INFO L426 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-09-14 17:15:52,821 INFO L426 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-09-14 17:15:52,822 INFO L426 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,823 INFO L426 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,824 INFO L426 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-09-14 17:15:52,825 INFO L426 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-09-14 17:15:52,826 INFO L426 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,827 INFO L426 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,828 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,829 INFO L426 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,830 INFO L426 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,831 INFO L426 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,832 INFO L426 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-09-14 17:15:52,833 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,834 INFO L426 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,835 INFO L426 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,836 INFO L426 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-09-14 17:15:52,836 INFO L426 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,836 INFO L426 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,836 INFO L426 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-09-14 17:15:52,836 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-14 17:15:52,836 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a23~0 312) (= ~a4~0 1) (<= ~a29~0 130) (= 10 ~a25~0) (= 15 ~a8~0) (<= 312 ~a23~0)) [2018-09-14 17:15:52,836 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-14 17:15:52,836 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-14 17:15:52,837 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (< 312 |old(~a23~0)|) (not (= 10 |old(~a25~0)|)) (not (= 15 ~a8~0)) (< |old(~a23~0)| 312) (not (= 1 |old(~a4~0)|)) (< 130 |old(~a29~0)|) (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= ~a4~0 1) (= ~a25~0 |old(~a25~0)|))) [2018-09-14 17:15:52,837 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-09-14 17:15:52,837 INFO L422 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse1 (not (= 9 ~a25~0))) (.cse0 (= ~a4~0 1)) (.cse2 (<= ~a23~0 138)) (.cse3 (< 245 ~a29~0)) (.cse4 (<= ~a29~0 140))) (or (and (< 306 ~a23~0) .cse0) (not (= 10 |old(~a25~0)|)) (and .cse1 .cse0) (= ~a25~0 12) (< |old(~a23~0)| 312) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse0 .cse2) (and .cse2 .cse4) (and .cse0 .cse4) (< 312 |old(~a23~0)|) (not (= 15 ~a8~0)) (and .cse2 .cse3) (and (= 10 ~a25~0) .cse4) (not (= 1 |old(~a4~0)|)) (< 130 |old(~a29~0)|))) [2018-09-14 17:15:52,837 INFO L426 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-09-14 17:15:52,837 INFO L426 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-09-14 17:15:52,837 INFO L426 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-09-14 17:15:52,837 INFO L422 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse1 (not (= 9 ~a25~0))) (.cse0 (= ~a4~0 1)) (.cse2 (<= ~a23~0 138)) (.cse3 (< 245 ~a29~0)) (.cse4 (<= ~a29~0 140))) (or (and (< 306 ~a23~0) .cse0) (not (= 10 |old(~a25~0)|)) (and .cse1 .cse0) (= ~a25~0 12) (< |old(~a23~0)| 312) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse0 .cse2) (and .cse2 .cse4) (and .cse0 .cse4) (< 312 |old(~a23~0)|) (not (= 15 ~a8~0)) (and .cse2 .cse3) (and (= 10 ~a25~0) .cse4) (not (= 1 |old(~a4~0)|)) (< 130 |old(~a29~0)|))) [2018-09-14 17:15:52,838 INFO L426 ceAbstractionStarter]: For program point L1034-4(lines 1028 1044) no Hoare annotation was computed. [2018-09-14 17:15:52,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 05:15:52 BoogieIcfgContainer [2018-09-14 17:15:52,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 17:15:52,858 INFO L168 Benchmark]: Toolchain (without parser) took 93333.14 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-14 17:15:52,859 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-14 17:15:52,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1008.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-09-14 17:15:52,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-14 17:15:52,861 INFO L168 Benchmark]: Boogie Preprocessor took 358.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -936.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-09-14 17:15:52,862 INFO L168 Benchmark]: RCFGBuilder took 4875.29 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 175.1 MB). Peak memory consumption was 175.1 MB. Max. memory is 7.1 GB. [2018-09-14 17:15:52,863 INFO L168 Benchmark]: TraceAbstraction took 86912.97 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 882.9 MB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -722.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-14 17:15:52,868 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1008.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 171.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 358.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 802.2 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -936.2 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4875.29 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 175.1 MB). Peak memory consumption was 175.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86912.97 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 882.9 MB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -722.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: 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: 1034]: Loop Invariant Derived loop invariant: (((((((((((((((306 < a23 && a4 == 1) || !(10 == \old(a25))) || (!(9 == a25) && a4 == 1)) || a25 == 12) || \old(a23) < 312) || (!(9 == a25) && a23 <= 138)) || (a4 == 1 && 245 < a29)) || (a4 == 1 && a23 <= 138)) || (a23 <= 138 && a29 <= 140)) || (a4 == 1 && a29 <= 140)) || 312 < \old(a23)) || !(15 == a8)) || (a23 <= 138 && 245 < a29)) || (10 == a25 && a29 <= 140)) || !(1 == \old(a4))) || 130 < \old(a29) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. SAFE Result, 86.8s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 54.1s AutomataDifference, 0.0s DeadEndRemovalTime, 6.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 3542 SDtfs, 10689 SDslu, 2824 SDs, 0 SdLazy, 27370 SolverSat, 4747 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6669 GetRequests, 6490 SyntacticMatches, 21 SemanticMatches, 158 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24637occurred 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: 2.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 5776 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 535 PreInvPairs, 749 NumberOfFragments, 494 HoareAnnotationTreeSize, 535 FomulaSimplifications, 41058 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8127 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 6463 NumberOfCodeBlocks, 6463 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9658 ConstructedInterpolants, 33 QuantifiedInterpolants, 7651239 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5718 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 35 InterpolantComputations, 14 PerfectInterpolantSequences, 7154/7455 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label44_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_17-15-52-885.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem11_label44_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_17-15-52-885.csv Received shutdown request...