java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:38,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:38,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:38,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:38,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:38,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:38,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:38,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:38,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:38,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:38,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:38,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:38,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:38,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:38,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:38,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:38,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:38,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:38,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:38,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:38,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:38,532 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:38,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:38,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:38,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:38,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:38,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:38,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:38,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:38,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:38,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:38,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:38,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:38,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:38,548 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:38,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:38,550 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:11:38,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:38,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:38,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:11:38,573 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:11:38,573 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:11:38,573 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:11:38,574 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:11:38,574 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:11:38,574 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:11:38,574 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:11:38,574 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:11:38,575 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:11:38,575 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:11:38,575 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:11:38,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:38,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:38,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:38,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:11:38,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:11:38,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:11:38,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:38,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:11:38,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:38,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:38,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:11:38,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:11:38,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:11:38,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:38,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:11:38,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:11:38,579 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:11:38,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:11:38,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:11:38,580 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:11:38,580 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:11:38,580 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:11:38,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:38,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:38,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:38,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:38,666 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:38,667 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c [2018-10-27 06:11:38,733 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/752d52088/fd3e84163ecc4623855ed80fd116ef54/FLAGe28e69773 [2018-10-27 06:11:39,318 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:39,319 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c [2018-10-27 06:11:39,341 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/752d52088/fd3e84163ecc4623855ed80fd116ef54/FLAGe28e69773 [2018-10-27 06:11:39,356 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/752d52088/fd3e84163ecc4623855ed80fd116ef54 [2018-10-27 06:11:39,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:39,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:11:39,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:39,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:39,376 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:39,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:39" (1/1) ... [2018-10-27 06:11:39,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b295a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:39, skipping insertion in model container [2018-10-27 06:11:39,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:39" (1/1) ... [2018-10-27 06:11:39,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:39,467 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:39,983 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:39,988 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:40,100 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:40,120 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:40,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40 WrapperNode [2018-10-27 06:11:40,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:40,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:40,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:40,122 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:40,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:40,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:40,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:40,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:40,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... [2018-10-27 06:11:40,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:40,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:40,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:40,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:40,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 06:11:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:11:40,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:11:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:11:40,507 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:11:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:11:40,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:11:43,736 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:43,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:43 BoogieIcfgContainer [2018-10-27 06:11:43,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:43,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:11:43,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:11:43,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:11:43,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:11:39" (1/3) ... [2018-10-27 06:11:43,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31345d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:11:43, skipping insertion in model container [2018-10-27 06:11:43,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:40" (2/3) ... [2018-10-27 06:11:43,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31345d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:11:43, skipping insertion in model container [2018-10-27 06:11:43,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:43" (3/3) ... [2018-10-27 06:11:43,746 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label09_true-unreach-call_false-termination.c [2018-10-27 06:11:43,756 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:11:43,765 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:11:43,783 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:11:43,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:11:43,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:11:43,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:11:43,823 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:43,823 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:43,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:11:43,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:43,823 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:11:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 06:11:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 06:11:43,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:43,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 06:11:43,870 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:43,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1669527864, now seen corresponding path program 1 times [2018-10-27 06:11:43,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:43,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:43,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:43,928 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:44,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:44,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:44,583 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:44,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:11:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:44,612 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 06:11:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:46,234 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-10-27 06:11:46,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:46,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-10-27 06:11:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:46,275 INFO L225 Difference]: With dead ends: 627 [2018-10-27 06:11:46,275 INFO L226 Difference]: Without dead ends: 388 [2018-10-27 06:11:46,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-27 06:11:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-10-27 06:11:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-27 06:11:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-10-27 06:11:46,382 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 128 [2018-10-27 06:11:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:46,383 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-10-27 06:11:46,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:11:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-10-27 06:11:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 06:11:46,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:46,390 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 06:11:46,391 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:46,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash -91961275, now seen corresponding path program 1 times [2018-10-27 06:11:46,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:46,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:46,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:46,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:46,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:46,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:46,963 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-10-27 06:11:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:48,797 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-10-27 06:11:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:48,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-27 06:11:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:48,803 INFO L225 Difference]: With dead ends: 905 [2018-10-27 06:11:48,803 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 06:11:48,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 06:11:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 06:11:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 06:11:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-10-27 06:11:48,831 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 137 [2018-10-27 06:11:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:48,832 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-10-27 06:11:48,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-10-27 06:11:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 06:11:48,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:48,837 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:48,837 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:48,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2004319935, now seen corresponding path program 1 times [2018-10-27 06:11:48,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:48,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:48,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:49,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:49,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:11:49,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:49,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:11:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:49,062 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-10-27 06:11:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:51,700 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-10-27 06:11:51,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:11:51,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-27 06:11:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:51,710 INFO L225 Difference]: With dead ends: 1241 [2018-10-27 06:11:51,710 INFO L226 Difference]: Without dead ends: 865 [2018-10-27 06:11:51,717 INFO L605 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-10-27 06:11:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-27 06:11:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-10-27 06:11:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-27 06:11:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-10-27 06:11:51,796 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 139 [2018-10-27 06:11:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:51,797 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-10-27 06:11:51,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-10-27 06:11:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 06:11:51,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:51,802 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:51,803 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:51,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash -430858735, now seen corresponding path program 1 times [2018-10-27 06:11:51,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:51,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:51,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:52,251 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 06:11:52,456 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:11:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:52,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:52,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-27 06:11:52,600 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:52,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 06:11:52,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:11:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:11:52,601 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 7 states. [2018-10-27 06:11:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:56,185 INFO L93 Difference]: Finished difference Result 2617 states and 4252 transitions. [2018-10-27 06:11:56,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:11:56,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2018-10-27 06:11:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:56,198 INFO L225 Difference]: With dead ends: 2617 [2018-10-27 06:11:56,198 INFO L226 Difference]: Without dead ends: 1805 [2018-10-27 06:11:56,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-10-27 06:11:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1800. [2018-10-27 06:11:56,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-10-27 06:11:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2733 transitions. [2018-10-27 06:11:56,262 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2733 transitions. Word has length 142 [2018-10-27 06:11:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:56,263 INFO L481 AbstractCegarLoop]: Abstraction has 1800 states and 2733 transitions. [2018-10-27 06:11:56,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 06:11:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2733 transitions. [2018-10-27 06:11:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 06:11:56,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:56,271 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:56,271 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:56,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1196711489, now seen corresponding path program 1 times [2018-10-27 06:11:56,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:56,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:56,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:56,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:56,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:56,501 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:11:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:11:56,675 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:56,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:11:56,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:56,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:56,676 INFO L87 Difference]: Start difference. First operand 1800 states and 2733 transitions. Second operand 6 states. [2018-10-27 06:11:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:58,626 INFO L93 Difference]: Finished difference Result 4620 states and 7211 transitions. [2018-10-27 06:11:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:58,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2018-10-27 06:11:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:58,648 INFO L225 Difference]: With dead ends: 4620 [2018-10-27 06:11:58,649 INFO L226 Difference]: Without dead ends: 2826 [2018-10-27 06:11:58,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-10-27 06:11:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2779. [2018-10-27 06:11:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2018-10-27 06:11:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4070 transitions. [2018-10-27 06:11:58,775 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4070 transitions. Word has length 150 [2018-10-27 06:11:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:58,775 INFO L481 AbstractCegarLoop]: Abstraction has 2779 states and 4070 transitions. [2018-10-27 06:11:58,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4070 transitions. [2018-10-27 06:11:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 06:11:58,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:58,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 06:11:58,787 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:58,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 443735674, now seen corresponding path program 1 times [2018-10-27 06:11:58,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:58,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:59,234 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 06:11:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:59,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:59,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:59,438 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:59,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:59,440 INFO L87 Difference]: Start difference. First operand 2779 states and 4070 transitions. Second operand 5 states. [2018-10-27 06:12:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:00,375 INFO L93 Difference]: Finished difference Result 5671 states and 8370 transitions. [2018-10-27 06:12:00,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:00,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-10-27 06:12:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:00,392 INFO L225 Difference]: With dead ends: 5671 [2018-10-27 06:12:00,393 INFO L226 Difference]: Without dead ends: 2750 [2018-10-27 06:12:00,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-10-27 06:12:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2018-10-27 06:12:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2018-10-27 06:12:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3975 transitions. [2018-10-27 06:12:00,483 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3975 transitions. Word has length 155 [2018-10-27 06:12:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:00,483 INFO L481 AbstractCegarLoop]: Abstraction has 2750 states and 3975 transitions. [2018-10-27 06:12:00,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:12:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3975 transitions. [2018-10-27 06:12:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 06:12:00,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:00,494 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:00,494 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:00,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:00,495 INFO L82 PathProgramCache]: Analyzing trace with hash -939036357, now seen corresponding path program 1 times [2018-10-27 06:12:00,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:00,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:00,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:00,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 06:12:00,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:00,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:00,612 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-10-27 06:12:00,615 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [83], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [695], [697], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:00,681 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:00,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:01,291 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:12:01,293 INFO L272 AbstractInterpreter]: Visited 129 different actions 129 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-27 06:12:01,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:01,339 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:12:01,771 INFO L227 lantSequenceWeakener]: Weakened 155 states. On average, predicates are now at 81.14% of their original sizes. [2018-10-27 06:12:01,771 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:02,116 INFO L415 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-10-27 06:12:02,116 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-27 06:12:02,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:02,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 06:12:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:12:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:12:02,119 INFO L87 Difference]: Start difference. First operand 2750 states and 3975 transitions. Second operand 7 states. [2018-10-27 06:12:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:11,209 INFO L93 Difference]: Finished difference Result 5642 states and 8157 transitions. [2018-10-27 06:12:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:12:11,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2018-10-27 06:12:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:11,225 INFO L225 Difference]: With dead ends: 5642 [2018-10-27 06:12:11,226 INFO L226 Difference]: Without dead ends: 2898 [2018-10-27 06:12:11,236 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:12:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2018-10-27 06:12:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2895. [2018-10-27 06:12:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2018-10-27 06:12:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4128 transitions. [2018-10-27 06:12:11,315 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4128 transitions. Word has length 164 [2018-10-27 06:12:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:11,316 INFO L481 AbstractCegarLoop]: Abstraction has 2895 states and 4128 transitions. [2018-10-27 06:12:11,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 06:12:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4128 transitions. [2018-10-27 06:12:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-27 06:12:11,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:11,326 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:11,327 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:11,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1140751716, now seen corresponding path program 1 times [2018-10-27 06:12:11,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:11,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:11,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:11,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:11,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 06:12:11,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:11,500 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:11,500 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-10-27 06:12:11,501 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [13], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [83], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [695], [697], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:11,508 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:11,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:11,739 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:12:11,739 INFO L272 AbstractInterpreter]: Visited 133 different actions 260 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 06:12:11,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:11,779 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:12:12,040 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 81.17% of their original sizes. [2018-10-27 06:12:12,041 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:12,573 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-10-27 06:12:12,574 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:12,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:12,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 06:12:12,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:12,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 06:12:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:12:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:12:12,577 INFO L87 Difference]: Start difference. First operand 2895 states and 4128 transitions. Second operand 11 states. [2018-10-27 06:12:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:19,592 INFO L93 Difference]: Finished difference Result 6096 states and 8679 transitions. [2018-10-27 06:12:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:12:19,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2018-10-27 06:12:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:19,607 INFO L225 Difference]: With dead ends: 6096 [2018-10-27 06:12:19,607 INFO L226 Difference]: Without dead ends: 3207 [2018-10-27 06:12:19,617 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-10-27 06:12:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2018-10-27 06:12:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3199. [2018-10-27 06:12:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2018-10-27 06:12:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 4453 transitions. [2018-10-27 06:12:19,696 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 4453 transitions. Word has length 174 [2018-10-27 06:12:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:19,696 INFO L481 AbstractCegarLoop]: Abstraction has 3199 states and 4453 transitions. [2018-10-27 06:12:19,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 06:12:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4453 transitions. [2018-10-27 06:12:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 06:12:19,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:19,708 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 06:12:19,708 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:19,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2045706540, now seen corresponding path program 1 times [2018-10-27 06:12:19,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:19,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 06:12:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:20,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:20,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-27 06:12:20,050 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [695], [697], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:20,055 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:20,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:20,316 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:12:20,316 INFO L272 AbstractInterpreter]: Visited 133 different actions 391 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 06:12:20,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:20,325 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:12:20,629 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 84.47% of their original sizes. [2018-10-27 06:12:20,630 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:20,746 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-10-27 06:12:20,747 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:20,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:20,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-10-27 06:12:20,748 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:20,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:12:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:12:20,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:12:20,750 INFO L87 Difference]: Start difference. First operand 3199 states and 4453 transitions. Second operand 10 states. [2018-10-27 06:12:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:27,604 INFO L93 Difference]: Finished difference Result 8496 states and 12073 transitions. [2018-10-27 06:12:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 06:12:27,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-10-27 06:12:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:27,627 INFO L225 Difference]: With dead ends: 8496 [2018-10-27 06:12:27,627 INFO L226 Difference]: Without dead ends: 5303 [2018-10-27 06:12:27,639 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-10-27 06:12:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2018-10-27 06:12:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5284. [2018-10-27 06:12:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5284 states. [2018-10-27 06:12:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 7092 transitions. [2018-10-27 06:12:27,782 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 7092 transitions. Word has length 190 [2018-10-27 06:12:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:27,783 INFO L481 AbstractCegarLoop]: Abstraction has 5284 states and 7092 transitions. [2018-10-27 06:12:27,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:12:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 7092 transitions. [2018-10-27 06:12:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-27 06:12:27,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:27,801 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:27,801 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:27,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash 577916684, now seen corresponding path program 1 times [2018-10-27 06:12:27,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:27,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:28,055 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 06:12:28,412 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 06:12:28,624 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:12:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 06:12:28,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:28,687 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:28,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-27 06:12:28,687 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [83], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [695], [697], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:28,690 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:28,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:28,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:28,960 INFO L272 AbstractInterpreter]: Visited 135 different actions 403 times. Merged at 9 different actions 22 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:28,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:28,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:28,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:28,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 06:12:28,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:28,975 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:29,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 06:12:29,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 109 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 06:12:30,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:30,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-10-27 06:12:30,433 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:30,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 06:12:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:12:30,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-27 06:12:30,435 INFO L87 Difference]: Start difference. First operand 5284 states and 7092 transitions. Second operand 15 states. [2018-10-27 06:12:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:34,615 INFO L93 Difference]: Finished difference Result 13568 states and 18845 transitions. [2018-10-27 06:12:34,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:12:34,616 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 201 [2018-10-27 06:12:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:34,616 INFO L225 Difference]: With dead ends: 13568 [2018-10-27 06:12:34,616 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:12:34,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2018-10-27 06:12:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:12:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:12:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:12:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:12:34,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2018-10-27 06:12:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:34,663 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:34,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 06:12:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:34,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:12:34,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:12:34,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:34,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:35,101 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 67 [2018-10-27 06:12:35,553 WARN L179 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-10-27 06:12:35,706 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-10-27 06:12:38,097 WARN L179 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 203 DAG size of output: 78 [2018-10-27 06:12:38,284 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2018-10-27 06:12:38,746 WARN L179 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2018-10-27 06:12:38,748 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:12:38,748 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|)) [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 06:12:38,749 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,750 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:12:38,751 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 06:12:38,752 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 06:12:38,753 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 06:12:38,754 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 06:12:38,755 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 06:12:38,756 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 06:12:38,757 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 06:12:38,758 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:12:38,759 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:12:38,760 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 06:12:38,761 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 06:12:38,762 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 06:12:38,763 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 06:12:38,768 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,768 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,768 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,768 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 06:12:38,769 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,770 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 06:12:38,771 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,772 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,773 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse16 (= 1 |old(~a25~0)|))) (let ((.cse17 (= ~a25~0 1)) (.cse18 (= 10 |old(~a28~0)|)) (.cse8 (not .cse16)) (.cse4 (not (= 1 ~a21~0))) (.cse9 (not (= 1 |old(~a19~0)|)))) (let ((.cse11 (= 1 ~a25~0)) (.cse3 (not (= |old(~a17~0)| 8))) (.cse1 (let ((.cse19 (not (= 0 |old(~a11~0)|)))) (and (or .cse4 (not .cse18) .cse8 .cse19 (not (= 0 |old(~a19~0)|))) (or .cse4 .cse9 (= 0 |old(~a28~0)|) .cse19)))) (.cse10 (not (= 8 |old(~a17~0)|))) (.cse0 (= |calculate_output_#in~input| 0)) (.cse15 (not .cse17)) (.cse2 (= |old(~a17~0)| |old(~a28~0)|)) (.cse12 (= |old(~a11~0)| |old(~a19~0)|)) (.cse5 (= |old(~a28~0)| ~a28~0)) (.cse6 (= |old(~a19~0)| ~a19~0)) (.cse7 (= ~a11~0 |old(~a11~0)|)) (.cse13 (= 7 ~a17~0)) (.cse14 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 .cse1 (= ~a25~0 0) .cse2 .cse3 (not (= 0 |old(~a25~0)|))) (or .cse4 (and .cse5 .cse6 .cse7 (= ~a17~0 |old(~a17~0)|)) .cse3) (or .cse4 .cse8 .cse9 .cse10 .cse11 (not (= 9 |old(~a28~0)|))) (or .cse4 .cse11 .cse8 .cse9 .cse12 .cse10) (or .cse4 (not (= 7 |old(~a28~0)|)) (and .cse5 (= 1 ~a11~0) .cse13 .cse11 (= 1 ~a19~0)) .cse8 .cse9 (not (= 1 |old(~a11~0)|)) .cse14) (or .cse4 .cse15 .cse3 .cse16) (or .cse1 .cse10 .cse0 (or .cse17 (= ~a19~0 1))) (or .cse4 (and .cse5 .cse6 .cse7 .cse15 .cse13) .cse2 .cse16 .cse14) (or .cse4 .cse18 .cse2 .cse12 (and .cse5 .cse6 .cse7 .cse13) .cse14))))) [2018-10-27 06:12:38,773 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,773 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,773 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,773 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 06:12:38,773 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 06:12:38,774 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,775 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 535) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 06:12:38,776 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 06:12:38,777 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 06:12:38,778 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:12:38,779 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:12:38,780 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-27 06:12:38,780 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:12:38,781 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:12:38,781 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7)) (not (= 0 |old(~a25~0)|))) [2018-10-27 06:12:38,781 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 06:12:38,781 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (= 7 ~a28~0))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (= |old(~a17~0)| ~a17~0) (and .cse0 (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0)) (and (not (= ~a25~0 1)) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (and .cse1 .cse2 (not (= ~a19~0 ~a11~0)) (not (= ~a28~0 10))) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))))) [2018-10-27 06:12:38,781 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:12:38,782 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:12:38,782 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (= 7 ~a28~0))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (= |old(~a17~0)| ~a17~0) (and .cse0 (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0)) (and (not (= ~a25~0 1)) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (and .cse1 .cse2 (not (= ~a19~0 ~a11~0)) (not (= ~a28~0 10))) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))))) [2018-10-27 06:12:38,782 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 06:12:38,782 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 06:12:38,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:12:38 BoogieIcfgContainer [2018-10-27 06:12:38,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:12:38,799 INFO L168 Benchmark]: Toolchain (without parser) took 59429.52 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-27 06:12:38,800 INFO L168 Benchmark]: CDTParser took 0.22 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-10-27 06:12:38,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.73 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:38,801 INFO L168 Benchmark]: Boogie Procedure Inliner took 216.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:38,802 INFO L168 Benchmark]: Boogie Preprocessor took 84.10 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:12:38,803 INFO L168 Benchmark]: RCFGBuilder took 3314.02 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: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:38,803 INFO L168 Benchmark]: TraceAbstraction took 55059.52 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 837.3 MB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -852.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-27 06:12:38,814 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.22 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 749.73 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 216.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.10 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3314.02 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: 119.4 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55059.52 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 837.3 MB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -852.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || \old(a17) == a17) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((!(a25 == 1) && 7 == a17) && !(7 == a28))) || !(1 == \old(a19))) || (((7 == a17 && !(7 == a28)) && !(a19 == a11)) && !(a28 == 10))) || !(8 == \old(a17))) || !(0 == \old(a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 54.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 40.0s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1521 SDtfs, 9755 SDslu, 2144 SDs, 0 SdLazy, 11504 SolverSat, 2374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1038 GetRequests, 933 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5284occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9967891475489744 AbsIntWeakeningRatio, 0.21714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 25.83238095238095 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 134 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 176 PreInvPairs, 286 NumberOfFragments, 517 HoareAnnotationTreeSize, 176 FomulaSimplifications, 10383 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4932 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1781 NumberOfCodeBlocks, 1781 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1970 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310748 SizeOfPredicates, 1 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 608/699 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...