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-d380424 [2018-10-25 00:04:41,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:04:41,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:04:41,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:04:41,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:04:41,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:04:41,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:04:41,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:04:41,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:04:41,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:04:41,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:04:41,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:04:41,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:04:41,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:04:41,570 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:04:41,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:04:41,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:04:41,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:04:41,575 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:04:41,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:04:41,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:04:41,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:04:41,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:04:41,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:04:41,582 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:04:41,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:04:41,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:04:41,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:04:41,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:04:41,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:04:41,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:04:41,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:04:41,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:04:41,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:04:41,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:04:41,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:04:41,590 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-25 00:04:41,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:04:41,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:04:41,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:04:41,612 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:04:41,612 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:04:41,615 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:04:41,615 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:04:41,615 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:04:41,616 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:04:41,616 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:04:41,616 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:04:41,616 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:04:41,616 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:04:41,617 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:04:41,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:04:41,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:04:41,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:04:41,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:04:41,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:04:41,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:04:41,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:04:41,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:04:41,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:04:41,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:04:41,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:04:41,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:04:41,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:04:41,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:04:41,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:04:41,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:04:41,621 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:04:41,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:04:41,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:04:41,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:04:41,622 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:04:41,622 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:04:41,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:04:41,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:04:41,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:04:41,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:04:41,706 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:04:41,707 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-25 00:04:41,786 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6e6b1c699/2bfa1ab4d0b746bfaea43c4a5941519b/FLAGfba4f401d [2018-10-25 00:04:42,349 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:04:42,353 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c [2018-10-25 00:04:42,367 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6e6b1c699/2bfa1ab4d0b746bfaea43c4a5941519b/FLAGfba4f401d [2018-10-25 00:04:42,380 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6e6b1c699/2bfa1ab4d0b746bfaea43c4a5941519b [2018-10-25 00:04:42,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:04:42,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:04:42,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:04:42,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:04:42,401 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:04:42,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:04:42" (1/1) ... [2018-10-25 00:04:42,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a25570f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:42, skipping insertion in model container [2018-10-25 00:04:42,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:04:42" (1/1) ... [2018-10-25 00:04:42,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:04:42,481 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:04:42,932 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:04:42,936 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:04:43,078 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:04:43,098 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:04:43,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43 WrapperNode [2018-10-25 00:04:43,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:04:43,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:04:43,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:04:43,101 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:04:43,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:04:43,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:04:43,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:04:43,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:04:43,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (1/1) ... [2018-10-25 00:04:43,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:04:43,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:04:43,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:04:43,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:04:43,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (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-25 00:04:43,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:04:43,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:04:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:04:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:04:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:04:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:04:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:04:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:04:46,774 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:04:46,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:04:46 BoogieIcfgContainer [2018-10-25 00:04:46,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:04:46,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:04:46,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:04:46,780 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:04:46,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:04:42" (1/3) ... [2018-10-25 00:04:46,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207bf428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:04:46, skipping insertion in model container [2018-10-25 00:04:46,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:43" (2/3) ... [2018-10-25 00:04:46,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207bf428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:04:46, skipping insertion in model container [2018-10-25 00:04:46,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:04:46" (3/3) ... [2018-10-25 00:04:46,784 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label09_true-unreach-call_false-termination.c [2018-10-25 00:04:46,794 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:04:46,804 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:04:46,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:04:46,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:04:46,861 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:04:46,861 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:04:46,861 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:04:46,861 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:04:46,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:04:46,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:04:46,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:04:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:04:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-25 00:04:46,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:46,906 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-25 00:04:46,909 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:46,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1669527864, now seen corresponding path program 1 times [2018-10-25 00:04:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:46,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:46,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:46,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:47,603 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:04:47,699 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-25 00:04:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:47,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:04:47,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:47,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:47,730 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:04:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:49,202 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-10-25 00:04:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:49,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-10-25 00:04:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:49,224 INFO L225 Difference]: With dead ends: 627 [2018-10-25 00:04:49,224 INFO L226 Difference]: Without dead ends: 388 [2018-10-25 00:04:49,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-25 00:04:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-10-25 00:04:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-25 00:04:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-10-25 00:04:49,318 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 128 [2018-10-25 00:04:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:49,321 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-10-25 00:04:49,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-10-25 00:04:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-25 00:04:49,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:49,334 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-25 00:04:49,335 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:49,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash -91961275, now seen corresponding path program 1 times [2018-10-25 00:04:49,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:49,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:49,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:49,798 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-25 00:04:49,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:49,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:49,799 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:49,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:49,802 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-10-25 00:04:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:51,554 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-10-25 00:04:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:51,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-25 00:04:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:51,560 INFO L225 Difference]: With dead ends: 905 [2018-10-25 00:04:51,560 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:04:51,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:04:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:04:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:04:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-10-25 00:04:51,594 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 137 [2018-10-25 00:04:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:51,594 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-10-25 00:04:51,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-10-25 00:04:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 00:04:51,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:51,598 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-25 00:04:51,598 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:51,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2004319935, now seen corresponding path program 1 times [2018-10-25 00:04:51,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:51,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:51,601 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:51,833 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-25 00:04:51,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:51,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:51,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:51,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:51,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:51,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:51,835 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-10-25 00:04:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:54,653 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-10-25 00:04:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:04:54,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-10-25 00:04:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:54,673 INFO L225 Difference]: With dead ends: 1241 [2018-10-25 00:04:54,673 INFO L226 Difference]: Without dead ends: 865 [2018-10-25 00:04:54,676 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-25 00:04:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-25 00:04:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-10-25 00:04:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-25 00:04:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-10-25 00:04:54,744 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 139 [2018-10-25 00:04:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:54,744 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-10-25 00:04:54,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-10-25 00:04:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 00:04:54,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:54,750 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-25 00:04:54,750 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:54,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -430858735, now seen corresponding path program 1 times [2018-10-25 00:04:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:54,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:54,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:54,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:54,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:55,196 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-25 00:04:55,406 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:04:55,675 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:04:55,876 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-25 00:04:55,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 00:04:55,876 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:55,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:04:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:04:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:04:55,878 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 7 states. [2018-10-25 00:04:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:59,452 INFO L93 Difference]: Finished difference Result 2617 states and 4252 transitions. [2018-10-25 00:04:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:04:59,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2018-10-25 00:04:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:59,472 INFO L225 Difference]: With dead ends: 2617 [2018-10-25 00:04:59,472 INFO L226 Difference]: Without dead ends: 1805 [2018-10-25 00:04:59,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:04:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-10-25 00:04:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1800. [2018-10-25 00:04:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-10-25 00:04:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2733 transitions. [2018-10-25 00:04:59,558 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2733 transitions. Word has length 142 [2018-10-25 00:04:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:59,561 INFO L481 AbstractCegarLoop]: Abstraction has 1800 states and 2733 transitions. [2018-10-25 00:04:59,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:04:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2733 transitions. [2018-10-25 00:04:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-25 00:04:59,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:59,574 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-25 00:04:59,574 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1196711489, now seen corresponding path program 1 times [2018-10-25 00:04:59,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:59,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:59,776 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-25 00:04:59,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:59,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:59,777 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:59,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:59,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:59,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:59,778 INFO L87 Difference]: Start difference. First operand 1800 states and 2733 transitions. Second operand 6 states. [2018-10-25 00:05:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:02,057 INFO L93 Difference]: Finished difference Result 4620 states and 7211 transitions. [2018-10-25 00:05:02,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:02,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2018-10-25 00:05:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:02,082 INFO L225 Difference]: With dead ends: 4620 [2018-10-25 00:05:02,082 INFO L226 Difference]: Without dead ends: 2826 [2018-10-25 00:05:02,095 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-25 00:05:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-10-25 00:05:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2779. [2018-10-25 00:05:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2018-10-25 00:05:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4070 transitions. [2018-10-25 00:05:02,216 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4070 transitions. Word has length 150 [2018-10-25 00:05:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:02,217 INFO L481 AbstractCegarLoop]: Abstraction has 2779 states and 4070 transitions. [2018-10-25 00:05:02,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:05:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4070 transitions. [2018-10-25 00:05:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-25 00:05:02,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:02,228 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-25 00:05:02,228 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:02,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash 443735674, now seen corresponding path program 1 times [2018-10-25 00:05:02,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:02,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:02,655 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-25 00:05:02,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:05:02,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:05:02,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:02,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:05:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:05:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:02,657 INFO L87 Difference]: Start difference. First operand 2779 states and 4070 transitions. Second operand 5 states. [2018-10-25 00:05:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:03,673 INFO L93 Difference]: Finished difference Result 5671 states and 8370 transitions. [2018-10-25 00:05:03,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:05:03,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-10-25 00:05:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:03,691 INFO L225 Difference]: With dead ends: 5671 [2018-10-25 00:05:03,691 INFO L226 Difference]: Without dead ends: 2750 [2018-10-25 00:05:03,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:05:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-10-25 00:05:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2018-10-25 00:05:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2018-10-25 00:05:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3975 transitions. [2018-10-25 00:05:03,793 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3975 transitions. Word has length 155 [2018-10-25 00:05:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:03,794 INFO L481 AbstractCegarLoop]: Abstraction has 2750 states and 3975 transitions. [2018-10-25 00:05:03,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:05:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3975 transitions. [2018-10-25 00:05:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 00:05:03,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:03,804 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-25 00:05:03,804 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:03,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash -939036357, now seen corresponding path program 1 times [2018-10-25 00:05:03,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:03,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:03,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:04,016 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-25 00:05:04,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:04,017 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:04,018 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-10-25 00:05:04,020 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-25 00:05:04,089 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:04,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:04,694 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:04,696 INFO L272 AbstractInterpreter]: Visited 129 different actions 129 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-25 00:05:04,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:04,722 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:05,230 INFO L232 lantSequenceWeakener]: Weakened 155 states. On average, predicates are now at 81.14% of their original sizes. [2018-10-25 00:05:05,230 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:05,536 INFO L413 sIntCurrentIteration]: We have 163 unified AI predicates [2018-10-25 00:05:05,536 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-25 00:05:05,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:05,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:05:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:05:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:05:05,538 INFO L87 Difference]: Start difference. First operand 2750 states and 3975 transitions. Second operand 7 states. [2018-10-25 00:05:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:15,510 INFO L93 Difference]: Finished difference Result 5642 states and 8157 transitions. [2018-10-25 00:05:15,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:05:15,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2018-10-25 00:05:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:15,524 INFO L225 Difference]: With dead ends: 5642 [2018-10-25 00:05:15,524 INFO L226 Difference]: Without dead ends: 2898 [2018-10-25 00:05:15,535 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-25 00:05:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2018-10-25 00:05:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2895. [2018-10-25 00:05:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2018-10-25 00:05:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4128 transitions. [2018-10-25 00:05:15,610 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4128 transitions. Word has length 164 [2018-10-25 00:05:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:15,610 INFO L481 AbstractCegarLoop]: Abstraction has 2895 states and 4128 transitions. [2018-10-25 00:05:15,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:05:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4128 transitions. [2018-10-25 00:05:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 00:05:15,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:15,621 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-25 00:05:15,621 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:15,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1140751716, now seen corresponding path program 1 times [2018-10-25 00:05:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:15,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:15,867 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-25 00:05:15,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:15,868 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:15,868 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-10-25 00:05:15,868 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-25 00:05:15,874 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:15,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:16,252 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:16,253 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-25 00:05:16,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:16,292 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:16,746 INFO L232 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 81.17% of their original sizes. [2018-10-25 00:05:16,747 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:17,760 INFO L413 sIntCurrentIteration]: We have 173 unified AI predicates [2018-10-25 00:05:17,760 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:17,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:17,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-25 00:05:17,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:17,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:05:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:05:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:05:17,763 INFO L87 Difference]: Start difference. First operand 2895 states and 4128 transitions. Second operand 11 states. [2018-10-25 00:05:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:27,038 INFO L93 Difference]: Finished difference Result 6096 states and 8679 transitions. [2018-10-25 00:05:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:05:27,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2018-10-25 00:05:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:27,052 INFO L225 Difference]: With dead ends: 6096 [2018-10-25 00:05:27,052 INFO L226 Difference]: Without dead ends: 3207 [2018-10-25 00:05:27,061 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-10-25 00:05:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2018-10-25 00:05:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3199. [2018-10-25 00:05:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2018-10-25 00:05:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 4453 transitions. [2018-10-25 00:05:27,140 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 4453 transitions. Word has length 174 [2018-10-25 00:05:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:27,140 INFO L481 AbstractCegarLoop]: Abstraction has 3199 states and 4453 transitions. [2018-10-25 00:05:27,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:05:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4453 transitions. [2018-10-25 00:05:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-25 00:05:27,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:27,151 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-25 00:05:27,152 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:27,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2045706540, now seen corresponding path program 1 times [2018-10-25 00:05:27,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:27,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:27,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:27,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:27,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:27,571 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-25 00:05:27,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:27,572 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:27,572 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-25 00:05:27,572 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-25 00:05:27,577 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:27,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:28,001 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:28,002 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-25 00:05:28,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:28,012 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:29,098 INFO L232 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 81.6% of their original sizes. [2018-10-25 00:05:29,098 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:32,788 INFO L413 sIntCurrentIteration]: We have 189 unified AI predicates [2018-10-25 00:05:32,789 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:32,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:32,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2018-10-25 00:05:32,790 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:32,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:05:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:05:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:05:32,791 INFO L87 Difference]: Start difference. First operand 3199 states and 4453 transitions. Second operand 15 states. [2018-10-25 00:05:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:53,253 INFO L93 Difference]: Finished difference Result 8699 states and 12353 transitions. [2018-10-25 00:05:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-25 00:05:53,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2018-10-25 00:05:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:53,277 INFO L225 Difference]: With dead ends: 8699 [2018-10-25 00:05:53,278 INFO L226 Difference]: Without dead ends: 5506 [2018-10-25 00:05:53,290 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 30 SyntacticMatches, 146 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:05:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2018-10-25 00:05:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 5476. [2018-10-25 00:05:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2018-10-25 00:05:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7386 transitions. [2018-10-25 00:05:53,453 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7386 transitions. Word has length 190 [2018-10-25 00:05:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:53,453 INFO L481 AbstractCegarLoop]: Abstraction has 5476 states and 7386 transitions. [2018-10-25 00:05:53,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:05:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7386 transitions. [2018-10-25 00:05:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-25 00:05:53,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:53,472 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-10-25 00:05:53,472 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:53,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1328626303, now seen corresponding path program 1 times [2018-10-25 00:05:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:53,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:53,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:53,876 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-25 00:05:54,258 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-25 00:05:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 77 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-25 00:05:54,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:54,288 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:54,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-10-25 00:05:54,288 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [13], [14], [18], [22], [25], [26], [30], [34], [37], [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-25 00:05:54,292 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:54,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:54,560 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:54,560 INFO L272 AbstractInterpreter]: Visited 134 different actions 268 times. Merged at 7 different actions 11 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:05:54,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:54,567 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:55,003 INFO L232 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 81.6% of their original sizes. [2018-10-25 00:05:55,004 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:57,589 INFO L413 sIntCurrentIteration]: We have 194 unified AI predicates [2018-10-25 00:05:57,589 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:57,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:57,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-25 00:05:57,590 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:57,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:05:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:05:57,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:05:57,592 INFO L87 Difference]: Start difference. First operand 5476 states and 7386 transitions. Second operand 14 states. [2018-10-25 00:06:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:05,839 INFO L93 Difference]: Finished difference Result 11839 states and 15865 transitions. [2018-10-25 00:06:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:06:05,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-10-25 00:06:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:05,868 INFO L225 Difference]: With dead ends: 11839 [2018-10-25 00:06:05,869 INFO L226 Difference]: Without dead ends: 6855 [2018-10-25 00:06:05,883 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 36 SyntacticMatches, 146 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:06:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6855 states. [2018-10-25 00:06:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6855 to 6679. [2018-10-25 00:06:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6679 states. [2018-10-25 00:06:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 8776 transitions. [2018-10-25 00:06:06,057 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 8776 transitions. Word has length 195 [2018-10-25 00:06:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:06,058 INFO L481 AbstractCegarLoop]: Abstraction has 6679 states and 8776 transitions. [2018-10-25 00:06:06,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:06:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 8776 transitions. [2018-10-25 00:06:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 00:06:06,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:06,077 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-25 00:06:06,077 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:06,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 577916684, now seen corresponding path program 1 times [2018-10-25 00:06:06,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:06,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:06,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:06,318 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:06:06,467 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-25 00:06:06,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:06,468 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:06,468 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-10-25 00:06:06,469 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-25 00:06:06,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:06,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:06,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:06,898 INFO L272 AbstractInterpreter]: Visited 135 different actions 411 times. Merged at 9 different actions 30 times. Widened at 1 different actions 2 times. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:06,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:06,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:06,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:06,908 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-25 00:06:06,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:06,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:07,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:07,336 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-25 00:06:07,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:07,748 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-25 00:06:07,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-10-25 00:06:07,771 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:07,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:06:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:06:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:06:07,773 INFO L87 Difference]: Start difference. First operand 6679 states and 8776 transitions. Second operand 15 states. [2018-10-25 00:06:09,897 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-10-25 00:06:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:13,057 INFO L93 Difference]: Finished difference Result 15796 states and 21608 transitions. [2018-10-25 00:06:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:06:13,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 201 [2018-10-25 00:06:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:13,058 INFO L225 Difference]: With dead ends: 15796 [2018-10-25 00:06:13,058 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:06:13,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2018-10-25 00:06:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:06:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:06:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:06:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:06:13,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2018-10-25 00:06:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:13,101 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:06:13,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:06:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:06:13,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:06:13,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:06:13,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:13,862 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 130 [2018-10-25 00:06:14,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:14,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:14,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:14,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:14,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:14,160 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 167 [2018-10-25 00:06:14,659 WARN L179 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-25 00:06:15,004 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 77 [2018-10-25 00:06:18,994 WARN L179 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 328 DAG size of output: 117 [2018-10-25 00:06:19,378 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 88 [2018-10-25 00:06:19,975 WARN L179 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 88 [2018-10-25 00:06:19,979 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:19,979 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-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:06:19,980 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:06:19,981 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:06:19,982 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:06:19,983 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,984 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:06:19,985 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,986 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:06:19,987 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 535) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:06:19,988 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:06:19,989 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:06:19,990 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,991 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:06:19,992 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:06:19,993 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:06:19,994 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,995 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:06:19,996 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,997 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,998 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,998 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse0 (not (= 1 ~a21~0))) (.cse6 (not (= 1 |old(~a19~0)|))) (.cse14 (= 1 |old(~a25~0)|))) (let ((.cse8 (= 1 ~a25~0)) (.cse5 (not .cse14)) (.cse7 (not (= 8 |old(~a17~0)|))) (.cse15 (or .cse0 .cse6 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) (= |calculate_output_#in~input| 0) (not (= 0 |old(~a25~0)|)))) (.cse16 (= ~a25~0 0)) (.cse10 (= 7 |old(~a28~0)|)) (.cse4 (not (= |old(~a17~0)| 8))) (.cse13 (not (= ~a25~0 1))) (.cse17 (= |old(~a17~0)| |old(~a28~0)|)) (.cse9 (= |old(~a11~0)| |old(~a19~0)|)) (.cse1 (= |old(~a28~0)| ~a28~0)) (.cse2 (= |old(~a19~0)| ~a19~0)) (.cse3 (= ~a11~0 |old(~a11~0)|)) (.cse11 (= 7 ~a17~0)) (.cse12 (not (= 7 |old(~a17~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (= ~a17~0 |old(~a17~0)|)) .cse4) (or .cse0 .cse5 .cse6 .cse7 .cse8 (not (= 9 |old(~a28~0)|))) (or .cse0 .cse8 .cse5 .cse6 .cse9 .cse7) (or .cse0 (not .cse10) (and .cse1 (= 1 ~a11~0) .cse11 .cse8 (= 1 ~a19~0)) .cse5 .cse6 (not (= 1 |old(~a11~0)|)) .cse12) (or .cse0 .cse13 .cse4 .cse14) (or (not (= |old(~a28~0)| 7)) .cse15 (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) .cse16 .cse7) (or .cse15 .cse16 .cse10 .cse17 .cse4) (or .cse0 (and .cse1 .cse2 .cse3 .cse13 .cse11) .cse17 .cse14 .cse12) (or .cse0 (= 10 |old(~a28~0)|) .cse17 .cse9 (and .cse1 .cse2 .cse3 .cse11) .cse12)))) [2018-10-25 00:06:19,998 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,998 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,998 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:19,998 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:06:19,998 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:06:19,999 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:06:20,000 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:06:20,001 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:06:20,002 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:06:20,003 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:06:20,004 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:20,005 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-25 00:06:20,005 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:06:20,005 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:20,005 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (and (= ~a25~0 0) (= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:06:20,005 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:06:20,005 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 (= ~a17~0 |old(~a17~0)|) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0)) (and (not (= ~a25~0 1)) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse2 (not (= ~a19~0 ~a11~0)) (not (= ~a28~0 10))) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:06:20,006 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:06:20,006 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:06:20,006 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 (= ~a17~0 |old(~a17~0)|) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0)) (and (not (= ~a25~0 1)) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse1 .cse2 (not (= ~a19~0 ~a11~0)) (not (= ~a28~0 10))) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-25 00:06:20,006 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:06:20,006 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:06:20,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:06:20 BoogieIcfgContainer [2018-10-25 00:06:20,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:06:20,030 INFO L168 Benchmark]: Toolchain (without parser) took 97635.13 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -969.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:06:20,031 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:06:20,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.90 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-25 00:06:20,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 190.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:20,036 INFO L168 Benchmark]: Boogie Preprocessor took 81.96 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:06:20,036 INFO L168 Benchmark]: RCFGBuilder took 3402.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:20,037 INFO L168 Benchmark]: TraceAbstraction took 93250.58 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -321.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:06:20,047 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 704.90 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 190.43 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.96 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3402.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93250.58 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -321.4 MB). Peak memory consumption was 1.5 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: (((((((((((((((((((a17 == \old(a17) || !(a21 == 1)) || !(y == 25)) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((!(a25 == 1) && 7 == a17) && !(7 == a28))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((7 == a17 && !(7 == a28)) && !(a19 == a11)) && !(a28 == 10))) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 93.1s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 66.5s AutomataDifference, 0.0s DeadEndRemovalTime, 6.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1696 SDtfs, 11793 SDslu, 1957 SDs, 0 SdLazy, 15389 SolverSat, 2198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1234 GetRequests, 818 SyntacticMatches, 298 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3268 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6679occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9965661679725335 AbsIntWeakeningRatio, 0.22253129346314326 AbsIntAvgWeakeningVarsNumRemoved, 7.013908205841447 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 321 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 222 PreInvPairs, 354 NumberOfFragments, 690 HoareAnnotationTreeSize, 222 FomulaSimplifications, 20352 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13818 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1976 NumberOfCodeBlocks, 1976 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2164 ConstructedInterpolants, 0 QuantifiedInterpolants, 1390870 SizeOfPredicates, 1 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 717/832 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...