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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:31:44,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:31:44,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:31:44,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:31:44,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:31:44,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:31:44,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:31:44,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:31:44,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:31:44,809 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:31:44,810 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:31:44,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:31:44,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:31:44,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:31:44,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:31:44,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:31:44,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:31:44,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:31:44,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:31:44,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:31:44,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:31:44,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:31:44,839 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:31:44,839 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:31:44,839 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:31:44,840 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:31:44,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:31:44,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:31:44,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:31:44,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:31:44,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:31:44,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:31:44,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:31:44,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:31:44,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:31:44,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:31:44,853 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 18:31:44,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:31:44,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:31:44,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:31:44,884 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:31:44,884 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:31:44,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:31:44,884 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:31:44,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:31:44,885 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:31:44,885 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:31:44,885 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:31:44,885 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:31:44,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:31:44,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:31:44,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:31:44,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:31:44,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:31:44,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:31:44,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:31:44,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:31:44,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:31:44,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:31:44,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:31:44,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:31:44,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:31:44,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:31:44,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:31:44,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:31:44,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:31:44,889 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:31:44,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:31:44,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:31:44,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:31:44,890 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:31:44,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:31:44,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:31:44,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:31:44,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:31:44,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:31:44,956 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:31:44,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-11-12 18:31:45,029 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19215ce6a/b8b88faa04344e158b20e8ff1718062a/FLAG7f55cfb28 [2018-11-12 18:31:45,603 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:31:45,604 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-11-12 18:31:45,619 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19215ce6a/b8b88faa04344e158b20e8ff1718062a/FLAG7f55cfb28 [2018-11-12 18:31:45,636 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19215ce6a/b8b88faa04344e158b20e8ff1718062a [2018-11-12 18:31:45,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:31:45,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:31:45,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:31:45,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:31:45,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:31:45,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:31:45" (1/1) ... [2018-11-12 18:31:45,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce92097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:45, skipping insertion in model container [2018-11-12 18:31:45,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:31:45" (1/1) ... [2018-11-12 18:31:45,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:31:45,744 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:31:46,244 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:31:46,248 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:31:46,399 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:31:46,417 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:31:46,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46 WrapperNode [2018-11-12 18:31:46,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:31:46,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:31:46,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:31:46,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:31:46,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:31:46,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:31:46,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:31:46,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:31:46,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (1/1) ... [2018-11-12 18:31:46,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:31:46,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:31:46,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:31:46,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:31:46,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (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-11-12 18:31:46,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:31:46,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:31:46,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:31:46,727 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:31:46,727 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:31:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:31:46,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:31:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:31:46,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:31:50,034 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:31:50,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:31:50 BoogieIcfgContainer [2018-11-12 18:31:50,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:31:50,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:31:50,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:31:50,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:31:50,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:31:45" (1/3) ... [2018-11-12 18:31:50,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97d21a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:31:50, skipping insertion in model container [2018-11-12 18:31:50,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:31:46" (2/3) ... [2018-11-12 18:31:50,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97d21a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:31:50, skipping insertion in model container [2018-11-12 18:31:50,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:31:50" (3/3) ... [2018-11-12 18:31:50,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2018-11-12 18:31:50,057 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:31:50,066 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:31:50,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:31:50,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:31:50,124 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:31:50,124 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:31:50,124 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:31:50,125 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:31:50,125 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:31:50,125 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:31:50,125 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:31:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-12 18:31:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-12 18:31:50,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:50,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:31:50,170 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:50,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 382760497, now seen corresponding path program 1 times [2018-11-12 18:31:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:50,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:50,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:50,736 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:31:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:50,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:50,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:31:50,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:50,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:31:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:31:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:31:50,900 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-12 18:31:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:52,505 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-12 18:31:52,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:31:52,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-12 18:31:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:52,528 INFO L225 Difference]: With dead ends: 574 [2018-11-12 18:31:52,528 INFO L226 Difference]: Without dead ends: 356 [2018-11-12 18:31:52,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:31:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-12 18:31:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-12 18:31:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-12 18:31:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 592 transitions. [2018-11-12 18:31:52,627 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 592 transitions. Word has length 71 [2018-11-12 18:31:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:52,628 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 592 transitions. [2018-11-12 18:31:52,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:31:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 592 transitions. [2018-11-12 18:31:52,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-12 18:31:52,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:52,638 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:31:52,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:52,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1446129720, now seen corresponding path program 1 times [2018-11-12 18:31:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:52,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:52,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:52,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:52,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:52,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:31:52,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:52,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:31:52,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:31:52,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:31:52,978 INFO L87 Difference]: Start difference. First operand 356 states and 592 transitions. Second operand 6 states. [2018-11-12 18:31:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:31:55,488 INFO L93 Difference]: Finished difference Result 1002 states and 1689 transitions. [2018-11-12 18:31:55,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:31:55,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-11-12 18:31:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:31:55,497 INFO L225 Difference]: With dead ends: 1002 [2018-11-12 18:31:55,497 INFO L226 Difference]: Without dead ends: 652 [2018-11-12 18:31:55,502 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-11-12 18:31:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-12 18:31:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 640. [2018-11-12 18:31:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-12 18:31:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 960 transitions. [2018-11-12 18:31:55,551 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 960 transitions. Word has length 141 [2018-11-12 18:31:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:31:55,552 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 960 transitions. [2018-11-12 18:31:55,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:31:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 960 transitions. [2018-11-12 18:31:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-12 18:31:55,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:31:55,558 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:31:55,558 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:31:55,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:31:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1467562684, now seen corresponding path program 1 times [2018-11-12 18:31:55,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:31:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:31:55,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:31:55,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:31:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:31:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:31:55,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:31:55,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:31:55,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:31:55,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:31:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:31:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:31:55,891 INFO L87 Difference]: Start difference. First operand 640 states and 960 transitions. Second operand 4 states. [2018-11-12 18:32:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:00,414 INFO L93 Difference]: Finished difference Result 2128 states and 3336 transitions. [2018-11-12 18:32:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:32:00,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-12 18:32:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:00,425 INFO L225 Difference]: With dead ends: 2128 [2018-11-12 18:32:00,426 INFO L226 Difference]: Without dead ends: 904 [2018-11-12 18:32:00,434 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-12 18:32:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-12 18:32:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-11-12 18:32:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-12 18:32:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1277 transitions. [2018-11-12 18:32:00,470 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1277 transitions. Word has length 151 [2018-11-12 18:32:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:00,471 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1277 transitions. [2018-11-12 18:32:00,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:32:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1277 transitions. [2018-11-12 18:32:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 18:32:00,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:00,476 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:32:00,477 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:00,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash -774507349, now seen corresponding path program 1 times [2018-11-12 18:32:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:00,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:00,777 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:32:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:32:01,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:32:01,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:32:01,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:32:01,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:32:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:32:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:32:01,163 INFO L87 Difference]: Start difference. First operand 904 states and 1277 transitions. Second operand 6 states. [2018-11-12 18:32:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:02,796 INFO L93 Difference]: Finished difference Result 2127 states and 3078 transitions. [2018-11-12 18:32:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:32:02,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2018-11-12 18:32:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:02,807 INFO L225 Difference]: With dead ends: 2127 [2018-11-12 18:32:02,808 INFO L226 Difference]: Without dead ends: 1229 [2018-11-12 18:32:02,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:32:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-11-12 18:32:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1208. [2018-11-12 18:32:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-12 18:32:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1646 transitions. [2018-11-12 18:32:02,852 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1646 transitions. Word has length 194 [2018-11-12 18:32:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:02,853 INFO L480 AbstractCegarLoop]: Abstraction has 1208 states and 1646 transitions. [2018-11-12 18:32:02,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:32:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1646 transitions. [2018-11-12 18:32:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-12 18:32:02,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:02,859 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:32:02,859 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:02,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1703489504, now seen corresponding path program 1 times [2018-11-12 18:32:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:02,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:02,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 128 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 18:32:03,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:03,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:32:03,163 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-12 18:32:03,165 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:32:03,230 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:32:03,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:32:03,780 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:32:03,781 INFO L272 AbstractInterpreter]: Visited 93 different actions 93 times. Never merged. Never widened. Performed 827 root evaluator evaluations with a maximum evaluation depth of 5. Performed 827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 18:32:03,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:03,836 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:32:04,370 INFO L227 lantSequenceWeakener]: Weakened 233 states. On average, predicates are now at 73.67% of their original sizes. [2018-11-12 18:32:04,371 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:32:04,511 INFO L415 sIntCurrentIteration]: We unified 241 AI predicates to 241 [2018-11-12 18:32:04,512 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:32:04,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:32:04,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-12 18:32:04,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:32:04,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 18:32:04,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 18:32:04,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:32:04,515 INFO L87 Difference]: Start difference. First operand 1208 states and 1646 transitions. Second operand 7 states. [2018-11-12 18:32:06,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:32:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:18,000 INFO L93 Difference]: Finished difference Result 2556 states and 3478 transitions. [2018-11-12 18:32:18,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:32:18,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 242 [2018-11-12 18:32:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:18,009 INFO L225 Difference]: With dead ends: 2556 [2018-11-12 18:32:18,009 INFO L226 Difference]: Without dead ends: 1354 [2018-11-12 18:32:18,015 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:32:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-12 18:32:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-12 18:32:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-12 18:32:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1796 transitions. [2018-11-12 18:32:18,061 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1796 transitions. Word has length 242 [2018-11-12 18:32:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:18,062 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1796 transitions. [2018-11-12 18:32:18,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 18:32:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1796 transitions. [2018-11-12 18:32:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-12 18:32:18,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:18,074 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 18:32:18,074 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:18,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -677086258, now seen corresponding path program 1 times [2018-11-12 18:32:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:18,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:18,916 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-12 18:32:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-12 18:32:19,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:19,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:32:19,541 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-12 18:32:19,542 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:32:19,552 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:32:19,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:32:19,653 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:32:19,991 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:32:19,991 INFO L272 AbstractInterpreter]: Visited 97 different actions 278 times. Merged at 5 different actions 9 times. Never widened. Performed 3735 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3735 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 18:32:20,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:20,035 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:32:20,629 INFO L227 lantSequenceWeakener]: Weakened 102 states. On average, predicates are now at 75.47% of their original sizes. [2018-11-12 18:32:20,630 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:32:21,727 INFO L415 sIntCurrentIteration]: We unified 312 AI predicates to 312 [2018-11-12 18:32:21,727 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:32:21,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:32:21,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-12 18:32:21,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:32:21,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:32:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:32:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:32:21,730 INFO L87 Difference]: Start difference. First operand 1352 states and 1796 transitions. Second operand 21 states. [2018-11-12 18:32:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:32:41,706 INFO L93 Difference]: Finished difference Result 3086 states and 4147 transitions. [2018-11-12 18:32:41,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 18:32:41,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 313 [2018-11-12 18:32:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:32:41,716 INFO L225 Difference]: With dead ends: 3086 [2018-11-12 18:32:41,716 INFO L226 Difference]: Without dead ends: 1884 [2018-11-12 18:32:41,722 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 330 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 18:32:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-11-12 18:32:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1877. [2018-11-12 18:32:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-11-12 18:32:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2374 transitions. [2018-11-12 18:32:41,775 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2374 transitions. Word has length 313 [2018-11-12 18:32:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:32:41,775 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2374 transitions. [2018-11-12 18:32:41,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:32:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2374 transitions. [2018-11-12 18:32:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-11-12 18:32:41,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:32:41,787 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 18:32:41,787 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:32:41,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 765572205, now seen corresponding path program 1 times [2018-11-12 18:32:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:32:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:41,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:32:41,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:32:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 283 proven. 158 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 18:32:42,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:42,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:32:42,921 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-11-12 18:32:42,922 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:32:42,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:32:42,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:32:43,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:32:43,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:32:43,404 INFO L272 AbstractInterpreter]: Visited 126 different actions 493 times. Merged at 8 different actions 25 times. Never widened. Performed 6558 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:32:43,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:32:43,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:32:43,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:32:43,411 INFO L192 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-11-12 18:32:43,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:32:43,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:32:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:32:43,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:33:01,416 WARN L179 SmtUtils]: Spent 17.06 s on a formula simplification. DAG size of input: 184 DAG size of output: 52 [2018-11-12 18:33:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 377 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-12 18:33:02,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:33:02,943 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-12 18:33:03,057 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-12 18:33:08,392 WARN L179 SmtUtils]: Spent 4.84 s on a formula simplification. DAG size of input: 316 DAG size of output: 22 [2018-11-12 18:33:08,850 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-12 18:33:08,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-12 18:33:09,011 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-11-12 18:33:09,523 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-11-12 18:33:09,528 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:09,579 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:09,634 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:09,718 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:09,755 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,095 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,276 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,392 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,541 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,640 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,680 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,723 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,769 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,811 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,889 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:10,933 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:11,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:11,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:11,339 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:11,392 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:11,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:11,807 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,081 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,121 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,164 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,312 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,414 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,565 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,609 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,650 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,693 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,803 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,890 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,933 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:12,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,013 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,057 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,098 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,149 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,270 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,322 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,364 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,404 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,614 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,679 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,876 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,920 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:13,992 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,315 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,417 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,537 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,695 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,735 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,774 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,815 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,852 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,890 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,927 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:14,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,003 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,049 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,175 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,211 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,247 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,288 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,369 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,448 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,485 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:15,832 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:16,557 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:16,598 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:16,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:16,706 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,020 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,287 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,330 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,394 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,546 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,585 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,623 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,660 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,697 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:17,773 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-12 18:33:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 202 proven. 239 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 18:33:18,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:33:18,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2018-11-12 18:33:18,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:33:18,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 18:33:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 18:33:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2018-11-12 18:33:18,466 INFO L87 Difference]: Start difference. First operand 1877 states and 2374 transitions. Second operand 18 states. [2018-11-12 18:33:20,126 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2018-11-12 18:33:37,577 WARN L179 SmtUtils]: Spent 15.46 s on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-11-12 18:33:44,053 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-11-12 18:33:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:46,280 INFO L93 Difference]: Finished difference Result 6876 states and 9595 transitions. [2018-11-12 18:33:46,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 18:33:46,280 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 358 [2018-11-12 18:33:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:46,310 INFO L225 Difference]: With dead ends: 6876 [2018-11-12 18:33:46,310 INFO L226 Difference]: Without dead ends: 5301 [2018-11-12 18:33:46,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 628 SyntacticMatches, 111 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3412 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=805, Invalid=2855, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 18:33:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2018-11-12 18:33:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5094. [2018-11-12 18:33:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5094 states. [2018-11-12 18:33:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5094 states to 5094 states and 6649 transitions. [2018-11-12 18:33:46,456 INFO L78 Accepts]: Start accepts. Automaton has 5094 states and 6649 transitions. Word has length 358 [2018-11-12 18:33:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:46,456 INFO L480 AbstractCegarLoop]: Abstraction has 5094 states and 6649 transitions. [2018-11-12 18:33:46,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 18:33:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5094 states and 6649 transitions. [2018-11-12 18:33:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-11-12 18:33:46,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:46,481 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 18:33:46,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:46,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash 651085646, now seen corresponding path program 1 times [2018-11-12 18:33:46,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:46,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:46,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:46,990 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-12 18:33:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-12 18:33:47,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:33:47,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:33:47,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:33:47,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:33:47,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:33:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:33:47,061 INFO L87 Difference]: Start difference. First operand 5094 states and 6649 transitions. Second operand 4 states. [2018-11-12 18:33:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:48,305 INFO L93 Difference]: Finished difference Result 12795 states and 17583 transitions. [2018-11-12 18:33:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:33:48,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2018-11-12 18:33:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:48,344 INFO L225 Difference]: With dead ends: 12795 [2018-11-12 18:33:48,345 INFO L226 Difference]: Without dead ends: 8003 [2018-11-12 18:33:48,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:33:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2018-11-12 18:33:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 7991. [2018-11-12 18:33:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7991 states. [2018-11-12 18:33:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7991 states to 7991 states and 10577 transitions. [2018-11-12 18:33:48,597 INFO L78 Accepts]: Start accepts. Automaton has 7991 states and 10577 transitions. Word has length 377 [2018-11-12 18:33:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:48,598 INFO L480 AbstractCegarLoop]: Abstraction has 7991 states and 10577 transitions. [2018-11-12 18:33:48,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:33:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7991 states and 10577 transitions. [2018-11-12 18:33:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-12 18:33:48,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:48,637 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:33:48,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:48,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -268100511, now seen corresponding path program 1 times [2018-11-12 18:33:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:48,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 269 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-11-12 18:33:49,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:33:49,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:33:49,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-11-12 18:33:49,357 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [558], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:33:49,360 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:33:49,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:33:49,460 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:33:49,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:33:49,807 INFO L272 AbstractInterpreter]: Visited 133 different actions 521 times. Merged at 8 different actions 25 times. Never widened. Performed 7001 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7001 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 6 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:33:49,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:49,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:33:49,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:33:49,811 INFO L192 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-11-12 18:33:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:49,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:33:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:49,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:33:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-12 18:33:50,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:33:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-12 18:33:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:33:50,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-12 18:33:50,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:33:50,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 18:33:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 18:33:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-12 18:33:50,496 INFO L87 Difference]: Start difference. First operand 7991 states and 10577 transitions. Second operand 11 states. [2018-11-12 18:33:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:33:52,969 INFO L93 Difference]: Finished difference Result 17459 states and 24255 transitions. [2018-11-12 18:33:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 18:33:52,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 396 [2018-11-12 18:33:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:33:53,049 INFO L225 Difference]: With dead ends: 17459 [2018-11-12 18:33:53,049 INFO L226 Difference]: Without dead ends: 9622 [2018-11-12 18:33:53,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 796 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:33:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2018-11-12 18:33:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 9189. [2018-11-12 18:33:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9189 states. [2018-11-12 18:33:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9189 states to 9189 states and 11801 transitions. [2018-11-12 18:33:53,366 INFO L78 Accepts]: Start accepts. Automaton has 9189 states and 11801 transitions. Word has length 396 [2018-11-12 18:33:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:33:53,367 INFO L480 AbstractCegarLoop]: Abstraction has 9189 states and 11801 transitions. [2018-11-12 18:33:53,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 18:33:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 9189 states and 11801 transitions. [2018-11-12 18:33:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-12 18:33:53,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:33:53,411 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 18:33:53,412 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:33:53,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash 642099933, now seen corresponding path program 1 times [2018-11-12 18:33:53,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:33:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:33:53,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:33:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:53,933 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 18:33:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 182 proven. 222 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-12 18:33:54,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:33:54,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:33:54,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-11-12 18:33:54,300 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [706], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [766], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-12 18:33:54,304 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:33:54,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:33:54,439 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:33:55,183 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:33:55,183 INFO L272 AbstractInterpreter]: Visited 148 different actions 873 times. Merged at 8 different actions 45 times. Widened at 1 different actions 1 times. Performed 11773 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11773 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 18:33:55,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:33:55,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:33:55,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:33:55,221 INFO L192 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-11-12 18:33:55,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:33:55,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:33:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:33:55,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:33:58,454 WARN L179 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-12 18:34:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 479 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:34:01,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:34:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-11-12 18:34:01,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-12 18:34:01,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 12] total 19 [2018-11-12 18:34:01,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:34:01,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:34:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:34:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-11-12 18:34:01,381 INFO L87 Difference]: Start difference. First operand 9189 states and 11801 transitions. Second operand 3 states. [2018-11-12 18:34:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:34:02,696 INFO L93 Difference]: Finished difference Result 19622 states and 25768 transitions. [2018-11-12 18:34:02,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:34:02,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2018-11-12 18:34:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:34:02,703 INFO L225 Difference]: With dead ends: 19622 [2018-11-12 18:34:02,703 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 18:34:02,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 820 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2018-11-12 18:34:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 18:34:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 18:34:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 18:34:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 18:34:02,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2018-11-12 18:34:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:34:02,759 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 18:34:02,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:34:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 18:34:02,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 18:34:02,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 18:34:02,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:02,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:03,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:03,244 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 229 [2018-11-12 18:34:03,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 18:34:03,536 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 227 [2018-11-12 18:34:04,176 WARN L179 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-11-12 18:34:04,455 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2018-11-12 18:34:08,198 WARN L179 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 278 DAG size of output: 53 [2018-11-12 18:34:09,412 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 243 DAG size of output: 70 [2018-11-12 18:34:12,937 WARN L179 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 243 DAG size of output: 70 [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:34:12,941 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a19~0 |old(~a19~0)|) (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,941 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-12 18:34:12,942 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-12 18:34:12,943 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,944 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,945 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-12 18:34:12,946 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,947 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-12 18:34:12,948 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,949 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-12 18:34:12,950 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,951 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-12 18:34:12,952 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,953 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-12 18:34:12,954 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse6 (= |old(~a10~0)| ~a10~0))) (let ((.cse1 (= 7 |old(~a19~0)|)) (.cse4 (< |old(~a10~0)| 1)) (.cse5 (= 4 |old(~a10~0)|)) (.cse2 (not (= 14 ~a4~0))) (.cse3 (not (= 0 ~a12~0))) (.cse7 (< 33 |old(~a1~0)|)) (.cse0 (and (= ~a19~0 |old(~a19~0)|) .cse6 (= ~a1~0 |old(~a1~0)|)))) (and (or .cse0 .cse1 (= 10 |old(~a19~0)|) .cse2 .cse3) (or .cse4 .cse5 .cse2 .cse3 .cse0 (= 1 |old(~a10~0)|)) (or .cse1 (< 38 |old(~a1~0)|) .cse2 .cse3 .cse0 (not (= |old(~a10~0)| 0))) (or (and (= 8 ~a19~0) .cse6) (not (= 8 |old(~a19~0)|))) (or .cse4 .cse5 .cse0 .cse2 .cse3 (<= |old(~a1~0)| 218)) (or .cse4 .cse1 .cse5 .cse0 .cse2 .cse3) (or .cse1 .cse5 .cse0 .cse2 .cse3 .cse7) (or .cse4 .cse5 .cse2 .cse3 .cse7 .cse0)))) [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-12 18:34:12,955 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-12 18:34:12,956 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-12 18:34:12,957 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-12 18:34:12,958 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 196) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-12 18:34:12,959 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-12 18:34:12,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 18:34:12,961 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputC~0 3) (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~inputB~0 2) (= ~a1~0 23) (= ~inputE~0 5) (= ~a4~0 14) (= ~inputD~0 4)) [2018-11-12 18:34:12,961 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 18:34:12,961 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 18:34:12,961 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= |old(~a1~0)| 23)) (not (= 0 ~a12~0)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= 3 ~inputC~0)) (not (= ~a4~0 14)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)) (and (= ~a10~0 |old(~a10~0)|) (= ~a1~0 23) (= ~a19~0 |old(~a19~0)|)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0))) [2018-11-12 18:34:12,961 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:34:12,961 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (<= ~a1~0 33)) (.cse3 (<= 1 ~a10~0)) (.cse2 (not (= ~a10~0 4))) (.cse0 (not (= 7 ~a19~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~a1~0)| 23)) (and (<= ~a1~0 38) .cse0 (= ~a10~0 |old(~a10~0)|)) (and (< 218 ~a1~0) (= 1 ~a10~0)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (not (= 4 ~inputD~0)) (and .cse0 .cse3 .cse2) (and .cse3 (not (= ~a10~0 1)) .cse2) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (and .cse0 (not (= ~a19~0 10))) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-12 18:34:12,962 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-12 18:34:12,962 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-12 18:34:12,962 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-12 18:34:12,962 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (<= ~a1~0 33)) (.cse3 (<= 1 ~a10~0)) (.cse2 (not (= ~a10~0 4))) (.cse0 (not (= 7 ~a19~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~a1~0)| 23)) (and (<= ~a1~0 38) .cse0 (= ~a10~0 |old(~a10~0)|)) (and (< 218 ~a1~0) (= 1 ~a10~0)) (not (= ~inputF~0 6)) (not (= |old(~a10~0)| 0)) (not (= ~a12~0 0)) (not (= 4 ~inputD~0)) (and .cse0 .cse3 .cse2) (and .cse3 (not (= ~a10~0 1)) .cse2) (not (= ~inputE~0 5)) (not (= 14 ~a4~0)) (and .cse0 (not (= ~a19~0 10))) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= |old(~a19~0)| 9)))) [2018-11-12 18:34:12,962 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-12 18:34:12,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:34:12 BoogieIcfgContainer [2018-11-12 18:34:12,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:34:12,976 INFO L168 Benchmark]: Toolchain (without parser) took 147323.03 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 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.2 GB. Max. memory is 7.1 GB. [2018-11-12 18:34:12,977 INFO L168 Benchmark]: CDTParser took 0.23 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-11-12 18:34:12,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:12,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:12,980 INFO L168 Benchmark]: Boogie Preprocessor took 95.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:12,981 INFO L168 Benchmark]: RCFGBuilder took 3382.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2018-11-12 18:34:12,981 INFO L168 Benchmark]: TraceAbstraction took 142938.30 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -669.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-12 18:34:12,986 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.23 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 763.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 138.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3382.11 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142938.30 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -669.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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: 582]: Loop Invariant Derived loop invariant: (((((((((((((((((!(7 == a19) && a1 <= 33) && !(a10 == 4)) || ((1 <= a10 && a1 <= 33) && !(a10 == 4))) || !(\old(a1) == 23)) || ((a1 <= 38 && !(7 == a19)) && a10 == \old(a10))) || (218 < a1 && 1 == a10)) || !(inputF == 6)) || !(\old(a10) == 0)) || !(a12 == 0)) || !(4 == inputD)) || ((!(7 == a19) && 1 <= a10) && !(a10 == 4))) || ((1 <= a10 && !(a10 == 1)) && !(a10 == 4))) || !(inputE == 5)) || !(14 == a4)) || (!(7 == a19) && !(a19 == 10))) || !(3 == inputC)) || !(2 == inputB)) || !(\old(a19) == 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 142.8s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 77.0s AutomataDifference, 0.0s DeadEndRemovalTime, 10.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1235 SDtfs, 9168 SDslu, 1444 SDs, 0 SdLazy, 14497 SolverSat, 2656 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3066 GetRequests, 2785 SyntacticMatches, 124 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3866 ImplicationChecksByTransitivity, 60.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9189occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9971711884833987 AbsIntWeakeningRatio, 0.10488245931283906 AbsIntAvgWeakeningVarsNumRemoved, 18.09764918625678 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 694 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 212 PreInvPairs, 346 NumberOfFragments, 538 HoareAnnotationTreeSize, 212 FomulaSimplifications, 6284 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14894 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 46.5s InterpolantComputationTime, 3825 NumberOfCodeBlocks, 3825 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4977 ConstructedInterpolants, 200 QuantifiedInterpolants, 13160515 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 4126/5481 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...