java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:11:44,653 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:11:44,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:11:44,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:11:44,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:11:44,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:11:44,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:11:44,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:11:44,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:11:44,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:11:44,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:11:44,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:11:44,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:11:44,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:11:44,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:11:44,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:11:44,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:11:44,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:11:44,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:11:44,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:11:44,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:11:44,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:11:44,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:11:44,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:11:44,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:11:44,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:11:44,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:11:44,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:11:44,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:11:44,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:11:44,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:11:44,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:11:44,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:11:44,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:11:44,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:11:44,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:11:44,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:11:44,723 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:11:44,724 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:11:44,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:11:44,725 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:11:44,725 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:11:44,725 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:11:44,725 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:11:44,725 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:11:44,728 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:11:44,728 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:11:44,728 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:11:44,729 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:11:44,729 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:11:44,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:11:44,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:11:44,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:11:44,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:11:44,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:11:44,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:11:44,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:11:44,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:11:44,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:11:44,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:11:44,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:11:44,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:11:44,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:11:44,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:11:44,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:11:44,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:11:44,734 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:11:44,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:11:44,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:11:44,734 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:11:44,736 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:11:44,736 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:11:44,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:11:44,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:11:44,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:11:44,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:11:44,805 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:11:44,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c [2018-11-12 17:11:44,864 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02d86f77/a78bb15579c34c40b99cf3dce7460d1f/FLAG8e8aba538 [2018-11-12 17:11:45,427 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:11:45,428 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label09_true-unreach-call_false-termination.c [2018-11-12 17:11:45,451 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02d86f77/a78bb15579c34c40b99cf3dce7460d1f/FLAG8e8aba538 [2018-11-12 17:11:45,468 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02d86f77/a78bb15579c34c40b99cf3dce7460d1f [2018-11-12 17:11:45,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:11:45,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:11:45,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:11:45,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:11:45,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:11:45,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:45" (1/1) ... [2018-11-12 17:11:45,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b52ee5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:45, skipping insertion in model container [2018-11-12 17:11:45,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:45" (1/1) ... [2018-11-12 17:11:45,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:11:45,565 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:11:46,060 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:11:46,072 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:11:46,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:11:46,224 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:11:46,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46 WrapperNode [2018-11-12 17:11:46,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:11:46,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:11:46,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:11:46,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:11:46,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:11:46,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:11:46,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:11:46,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:11:46,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2018-11-12 17:11:46,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:11:46,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:11:46,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:11:46,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:11:46,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:11:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:11:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:11:46,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:11:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:11:46,540 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:11:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:11:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:11:46,541 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:11:46,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:11:49,794 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:11:49,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:49 BoogieIcfgContainer [2018-11-12 17:11:49,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:11:49,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:11:49,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:11:49,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:11:49,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:11:45" (1/3) ... [2018-11-12 17:11:49,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785aca04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:49, skipping insertion in model container [2018-11-12 17:11:49,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (2/3) ... [2018-11-12 17:11:49,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785aca04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:49, skipping insertion in model container [2018-11-12 17:11:49,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:49" (3/3) ... [2018-11-12 17:11:49,812 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label09_true-unreach-call_false-termination.c [2018-11-12 17:11:49,824 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:11:49,838 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:11:49,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:11:49,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:11:49,913 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:11:49,913 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:11:49,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:11:49,913 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:11:49,914 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:11:49,914 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:11:49,914 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:11:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:11:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-12 17:11:49,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:49,976 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-11-12 17:11:49,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:49,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1669527864, now seen corresponding path program 1 times [2018-11-12 17:11:49,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:50,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:50,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:50,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:50,646 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:11:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:50,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:50,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:11:50,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:50,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:11:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:11:50,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:11:50,840 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:11:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:52,497 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-11-12 17:11:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:11:52,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-11-12 17:11:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:52,520 INFO L225 Difference]: With dead ends: 627 [2018-11-12 17:11:52,520 INFO L226 Difference]: Without dead ends: 388 [2018-11-12 17:11:52,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:11:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-12 17:11:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-11-12 17:11:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-12 17:11:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-11-12 17:11:52,608 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 128 [2018-11-12 17:11:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:52,610 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-11-12 17:11:52,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:11:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-11-12 17:11:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-12 17:11:52,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:52,617 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-11-12 17:11:52,617 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:52,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -91961275, now seen corresponding path program 1 times [2018-11-12 17:11:52,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:52,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:52,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:53,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:53,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:11:53,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:53,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:11:53,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:11:53,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:11:53,067 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-11-12 17:11:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:54,972 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-11-12 17:11:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:11:54,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-11-12 17:11:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:54,978 INFO L225 Difference]: With dead ends: 905 [2018-11-12 17:11:54,978 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:11:54,983 INFO L604 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-11-12 17:11:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:11:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-12 17:11:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:11:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-11-12 17:11:55,008 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 137 [2018-11-12 17:11:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:55,008 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-11-12 17:11:55,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:11:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-11-12 17:11:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 17:11:55,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:55,013 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-11-12 17:11:55,014 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:55,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2004319935, now seen corresponding path program 1 times [2018-11-12 17:11:55,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:55,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:55,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:55,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:55,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:55,252 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-12 17:11:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:55,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:55,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:11:55,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:55,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:11:55,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:11:55,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:11:55,420 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-11-12 17:11:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:11:57,965 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-11-12 17:11:57,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:11:57,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-11-12 17:11:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:11:57,981 INFO L225 Difference]: With dead ends: 1241 [2018-11-12 17:11:57,981 INFO L226 Difference]: Without dead ends: 865 [2018-11-12 17:11:57,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:11:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-12 17:11:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-11-12 17:11:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-12 17:11:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-11-12 17:11:58,047 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 139 [2018-11-12 17:11:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:11:58,047 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-11-12 17:11:58,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:11:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-11-12 17:11:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 17:11:58,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:11:58,051 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-11-12 17:11:58,052 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:11:58,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:11:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -430858735, now seen corresponding path program 1 times [2018-11-12 17:11:58,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:11:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:58,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:11:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:11:58,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:11:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:11:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:11:58,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:11:58,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 17:11:58,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:11:58,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 17:11:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 17:11:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:11:58,411 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 7 states. [2018-11-12 17:12:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:01,528 INFO L93 Difference]: Finished difference Result 2617 states and 4252 transitions. [2018-11-12 17:12:01,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 17:12:01,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2018-11-12 17:12:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:01,548 INFO L225 Difference]: With dead ends: 2617 [2018-11-12 17:12:01,549 INFO L226 Difference]: Without dead ends: 1805 [2018-11-12 17:12:01,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:12:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2018-11-12 17:12:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1800. [2018-11-12 17:12:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-11-12 17:12:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2733 transitions. [2018-11-12 17:12:01,650 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2733 transitions. Word has length 142 [2018-11-12 17:12:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:01,651 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2733 transitions. [2018-11-12 17:12:01,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 17:12:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2733 transitions. [2018-11-12 17:12:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-12 17:12:01,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:01,663 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-11-12 17:12:01,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:01,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:01,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1196711489, now seen corresponding path program 1 times [2018-11-12 17:12:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:01,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:01,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:01,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:12:01,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:01,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:12:01,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:12:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:12:01,831 INFO L87 Difference]: Start difference. First operand 1800 states and 2733 transitions. Second operand 6 states. [2018-11-12 17:12:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:03,641 INFO L93 Difference]: Finished difference Result 4620 states and 7211 transitions. [2018-11-12 17:12:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 17:12:03,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2018-11-12 17:12:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:03,659 INFO L225 Difference]: With dead ends: 4620 [2018-11-12 17:12:03,659 INFO L226 Difference]: Without dead ends: 2826 [2018-11-12 17:12:03,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:12:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-11-12 17:12:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2779. [2018-11-12 17:12:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2018-11-12 17:12:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4070 transitions. [2018-11-12 17:12:03,767 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4070 transitions. Word has length 150 [2018-11-12 17:12:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:03,768 INFO L480 AbstractCegarLoop]: Abstraction has 2779 states and 4070 transitions. [2018-11-12 17:12:03,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:12:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4070 transitions. [2018-11-12 17:12:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 17:12:03,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:03,808 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-11-12 17:12:03,809 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:03,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash 443735674, now seen corresponding path program 1 times [2018-11-12 17:12:03,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:03,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:12:04,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:12:04,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:12:04,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:04,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:12:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:12:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:12:04,099 INFO L87 Difference]: Start difference. First operand 2779 states and 4070 transitions. Second operand 5 states. [2018-11-12 17:12:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:04,959 INFO L93 Difference]: Finished difference Result 5671 states and 8370 transitions. [2018-11-12 17:12:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:12:04,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-12 17:12:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:04,984 INFO L225 Difference]: With dead ends: 5671 [2018-11-12 17:12:04,985 INFO L226 Difference]: Without dead ends: 2750 [2018-11-12 17:12:04,996 INFO L604 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-11-12 17:12:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2018-11-12 17:12:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2018-11-12 17:12:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2018-11-12 17:12:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3975 transitions. [2018-11-12 17:12:05,071 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3975 transitions. Word has length 155 [2018-11-12 17:12:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:05,072 INFO L480 AbstractCegarLoop]: Abstraction has 2750 states and 3975 transitions. [2018-11-12 17:12:05,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:12:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3975 transitions. [2018-11-12 17:12:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 17:12:05,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:05,082 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-11-12 17:12:05,082 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:05,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash -939036357, now seen corresponding path program 1 times [2018-11-12 17:12:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:05,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:05,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 17:12:05,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:05,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:05,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-11-12 17:12:05,223 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-11-12 17:12:05,270 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:05,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:06,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:06,071 INFO L272 AbstractInterpreter]: Visited 129 different actions 129 times. Never merged. Never widened. Performed 1827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 38 variables. [2018-11-12 17:12:06,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:06,114 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:06,759 INFO L227 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 81.37% of their original sizes. [2018-11-12 17:12:06,759 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:07,742 INFO L415 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-11-12 17:12:07,743 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:07,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:07,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [5] total 18 [2018-11-12 17:12:07,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:07,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:12:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:12:07,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:12:07,745 INFO L87 Difference]: Start difference. First operand 2750 states and 3975 transitions. Second operand 15 states. [2018-11-12 17:12:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:21,290 INFO L93 Difference]: Finished difference Result 5792 states and 8388 transitions. [2018-11-12 17:12:21,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 17:12:21,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-11-12 17:12:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:21,307 INFO L225 Difference]: With dead ends: 5792 [2018-11-12 17:12:21,307 INFO L226 Difference]: Without dead ends: 3048 [2018-11-12 17:12:21,316 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-11-12 17:12:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2018-11-12 17:12:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 2895. [2018-11-12 17:12:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2018-11-12 17:12:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4128 transitions. [2018-11-12 17:12:21,392 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4128 transitions. Word has length 164 [2018-11-12 17:12:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:21,393 INFO L480 AbstractCegarLoop]: Abstraction has 2895 states and 4128 transitions. [2018-11-12 17:12:21,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:12:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4128 transitions. [2018-11-12 17:12:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 17:12:21,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:21,403 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-11-12 17:12:21,404 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:21,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1140751716, now seen corresponding path program 1 times [2018-11-12 17:12:21,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:21,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:21,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:21,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:21,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-12 17:12:21,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:21,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:21,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-12 17:12:21,631 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-11-12 17:12:21,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:21,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:22,388 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:22,389 INFO L272 AbstractInterpreter]: Visited 133 different actions 262 times. Merged at 5 different actions 7 times. Never widened. Performed 3786 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3786 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-12 17:12:22,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:22,428 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:23,473 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 81.98% of their original sizes. [2018-11-12 17:12:23,473 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:27,596 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-11-12 17:12:27,597 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-12 17:12:27,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:27,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 17:12:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 17:12:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-12 17:12:27,601 INFO L87 Difference]: Start difference. First operand 2895 states and 4128 transitions. Second operand 22 states. [2018-11-12 17:12:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:47,301 INFO L93 Difference]: Finished difference Result 6538 states and 9205 transitions. [2018-11-12 17:12:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 17:12:47,302 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 174 [2018-11-12 17:12:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:47,317 INFO L225 Difference]: With dead ends: 6538 [2018-11-12 17:12:47,317 INFO L226 Difference]: Without dead ends: 3649 [2018-11-12 17:12:47,330 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 17:12:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2018-11-12 17:12:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3494. [2018-11-12 17:12:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2018-11-12 17:12:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 4784 transitions. [2018-11-12 17:12:47,423 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 4784 transitions. Word has length 174 [2018-11-12 17:12:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:47,423 INFO L480 AbstractCegarLoop]: Abstraction has 3494 states and 4784 transitions. [2018-11-12 17:12:47,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 17:12:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 4784 transitions. [2018-11-12 17:12:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-12 17:12:47,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:47,437 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-11-12 17:12:47,437 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:47,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:47,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2045706540, now seen corresponding path program 1 times [2018-11-12 17:12:47,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:47,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:12:48,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:48,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:48,058 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-11-12 17:12:48,058 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-11-12 17:12:48,063 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:48,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:48,587 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:48,588 INFO L272 AbstractInterpreter]: Visited 133 different actions 391 times. Merged at 7 different actions 14 times. Never widened. Performed 4796 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4796 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:12:48,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:48,595 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:48,941 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 81.07% of their original sizes. [2018-11-12 17:12:48,941 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:12:49,250 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-11-12 17:12:49,250 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:12:49,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:12:49,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-11-12 17:12:49,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:12:49,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:12:49,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:12:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:12:49,252 INFO L87 Difference]: Start difference. First operand 3494 states and 4784 transitions. Second operand 12 states. [2018-11-12 17:12:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:12:57,410 INFO L93 Difference]: Finished difference Result 8789 states and 12487 transitions. [2018-11-12 17:12:57,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:12:57,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2018-11-12 17:12:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:12:57,433 INFO L225 Difference]: With dead ends: 8789 [2018-11-12 17:12:57,433 INFO L226 Difference]: Without dead ends: 5598 [2018-11-12 17:12:57,445 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-11-12 17:12:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2018-11-12 17:12:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5577. [2018-11-12 17:12:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5577 states. [2018-11-12 17:12:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5577 states to 5577 states and 7483 transitions. [2018-11-12 17:12:57,956 INFO L78 Accepts]: Start accepts. Automaton has 5577 states and 7483 transitions. Word has length 190 [2018-11-12 17:12:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:12:57,957 INFO L480 AbstractCegarLoop]: Abstraction has 5577 states and 7483 transitions. [2018-11-12 17:12:57,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:12:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5577 states and 7483 transitions. [2018-11-12 17:12:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-12 17:12:57,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:12:57,975 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-11-12 17:12:57,975 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:12:57,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1328626303, now seen corresponding path program 1 times [2018-11-12 17:12:57,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:12:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:57,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:12:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:12:57,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:12:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:12:58,373 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-11-12 17:12:58,787 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 17:12:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 77 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-12 17:12:58,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:12:58,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:12:58,980 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-12 17:12:58,981 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-11-12 17:12:58,984 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:12:58,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:12:59,344 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:12:59,344 INFO L272 AbstractInterpreter]: Visited 134 different actions 270 times. Merged at 7 different actions 13 times. Never widened. Performed 3802 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3802 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:12:59,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:12:59,352 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:12:59,669 INFO L227 lantSequenceWeakener]: Weakened 106 states. On average, predicates are now at 81.38% of their original sizes. [2018-11-12 17:12:59,670 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:13:00,203 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-12 17:13:00,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:13:00,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:13:00,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-12 17:13:00,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:13:00,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 17:13:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 17:13:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:13:00,206 INFO L87 Difference]: Start difference. First operand 5577 states and 7483 transitions. Second operand 19 states. [2018-11-12 17:13:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:16,445 INFO L93 Difference]: Finished difference Result 11760 states and 15760 transitions. [2018-11-12 17:13:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 17:13:16,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-11-12 17:13:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:16,470 INFO L225 Difference]: With dead ends: 11760 [2018-11-12 17:13:16,471 INFO L226 Difference]: Without dead ends: 6486 [2018-11-12 17:13:16,482 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:13:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2018-11-12 17:13:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 6469. [2018-11-12 17:13:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6469 states. [2018-11-12 17:13:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6469 states to 6469 states and 8504 transitions. [2018-11-12 17:13:16,647 INFO L78 Accepts]: Start accepts. Automaton has 6469 states and 8504 transitions. Word has length 195 [2018-11-12 17:13:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:16,647 INFO L480 AbstractCegarLoop]: Abstraction has 6469 states and 8504 transitions. [2018-11-12 17:13:16,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 17:13:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6469 states and 8504 transitions. [2018-11-12 17:13:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-12 17:13:16,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:13:16,667 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-11-12 17:13:16,667 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:13:16,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 577916684, now seen corresponding path program 1 times [2018-11-12 17:13:16,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:13:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:13:16,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:13:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:16,881 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-12 17:13:17,245 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 17:13:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 17:13:17,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:17,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:13:17,405 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-12 17:13:17,405 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-11-12 17:13:17,408 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:13:17,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:13:17,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:13:17,943 INFO L272 AbstractInterpreter]: Visited 135 different actions 401 times. Merged at 8 different actions 20 times. Never widened. Performed 5800 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5800 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:13:17,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:13:17,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:13:17,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:13:17,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:13:17,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:13:17,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:13:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:13:18,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:13:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 17:13:18,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:13:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 109 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 17:13:18,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:13:18,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-11-12 17:13:18,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:13:18,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:13:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:13:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-11-12 17:13:18,593 INFO L87 Difference]: Start difference. First operand 6469 states and 8504 transitions. Second operand 15 states. [2018-11-12 17:13:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:13:22,554 INFO L93 Difference]: Finished difference Result 15501 states and 21153 transitions. [2018-11-12 17:13:22,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 17:13:22,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 201 [2018-11-12 17:13:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:13:22,556 INFO L225 Difference]: With dead ends: 15501 [2018-11-12 17:13:22,556 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:13:22,600 INFO L604 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-11-12 17:13:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:13:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:13:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:13:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:13:22,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2018-11-12 17:13:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:13:22,601 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:13:22,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:13:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:13:22,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:13:22,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:13:23,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:23,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:23,419 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 179 [2018-11-12 17:13:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:23,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:23,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:23,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:13:23,721 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 190 [2018-11-12 17:13:24,513 WARN L179 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-12 17:13:24,811 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 77 [2018-11-12 17:13:29,478 WARN L179 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 346 DAG size of output: 85 [2018-11-12 17:13:30,062 WARN L179 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 88 [2018-11-12 17:13:30,626 WARN L179 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 88 [2018-11-12 17:13:30,628 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:30,629 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-11-12 17:13:30,629 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:30,629 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,629 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,629 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,629 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:13:30,630 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,631 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:13:30,632 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:13:30,633 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:13:30,634 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,635 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:13:30,636 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,637 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:13:30,638 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:13:30,639 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:13:30,640 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:13:30,641 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,642 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:13:30,643 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,644 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:13:30,645 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse13 (= 1 |old(~a25~0)|))) (let ((.cse7 (not (= 8 |old(~a17~0)|))) (.cse8 (= 1 ~a25~0)) (.cse5 (not .cse13)) (.cse6 (not (= 1 |old(~a19~0)|))) (.cse1 (not (= |old(~a17~0)| 8))) (.cse12 (not (= ~a25~0 1))) (.cse0 (not (= 1 ~a21~0))) (.cse14 (= |old(~a17~0)| |old(~a28~0)|)) (.cse9 (= |old(~a11~0)| |old(~a19~0)|)) (.cse2 (= |old(~a28~0)| ~a28~0)) (.cse3 (= |old(~a19~0)| ~a19~0)) (.cse4 (= ~a11~0 |old(~a11~0)|)) (.cse10 (= 7 ~a17~0)) (.cse11 (not (= 7 |old(~a17~0)|)))) (and (or (< 6 |calculate_output_#in~input|) (or (< 10 |old(~a28~0)|) (< 1 |old(~a19~0)|) .cse0) (not (= 0 |old(~a11~0)|)) (and (<= ~a25~0 1) (<= 0 ~a25~0)) (< |old(~a25~0)| 0) (< |old(~a28~0)| 7) (< |old(~a19~0)| 0) (< 1 |old(~a25~0)|) .cse1 (< |calculate_output_#in~input| 1)) (or .cse0 (and .cse2 .cse3 .cse4 (= ~a17~0 |old(~a17~0)|)) .cse1) (or .cse0 .cse5 .cse6 .cse7 .cse8 (not (= 9 |old(~a28~0)|))) (or .cse0 .cse8 .cse5 .cse6 .cse9 .cse7) (or .cse0 (not (= 7 |old(~a28~0)|)) (and .cse2 (= 1 ~a11~0) .cse10 .cse8 (= 1 ~a19~0)) .cse5 .cse6 (not (= 1 |old(~a11~0)|)) .cse11) (or .cse0 .cse12 .cse1 .cse13) (or .cse0 (and .cse2 .cse3 .cse4 .cse12 .cse10) .cse14 .cse13 .cse11) (or .cse0 (= 10 |old(~a28~0)|) .cse14 .cse9 (and .cse2 .cse3 .cse4 .cse10) .cse11)))) [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,646 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:13:30,647 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:13:30,648 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 535) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,649 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:13:30,650 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:13:30,651 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-11-12 17:13:30,651 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:13:30,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:13:30,652 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-11-12 17:13:30,652 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:13:30,652 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-11-12 17:13:30,652 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:30,652 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:13:30,652 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-11-12 17:13:30,652 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:13:30,652 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:13:30,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:13:30 BoogieIcfgContainer [2018-11-12 17:13:30,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:13:30,669 INFO L168 Benchmark]: Toolchain (without parser) took 105187.81 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:30,670 INFO L168 Benchmark]: CDTParser took 0.25 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-11-12 17:13:30,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.83 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-11-12 17:13:30,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:30,672 INFO L168 Benchmark]: Boogie Preprocessor took 94.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:30,673 INFO L168 Benchmark]: RCFGBuilder took 3318.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2018-11-12 17:13:30,674 INFO L168 Benchmark]: TraceAbstraction took 100871.85 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -900.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-12 17:13:30,679 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.25 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 740.83 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 155.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3318.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100871.85 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 3.0 GB in the end (delta: -900.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 100.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 73.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1693 SDtfs, 13222 SDslu, 2611 SDs, 0 SdLazy, 16191 SolverSat, 2745 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1264 GetRequests, 1089 SyntacticMatches, 6 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6469occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.1s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9965910365198588 AbsIntWeakeningRatio, 0.22253129346314326 AbsIntAvgWeakeningVarsNumRemoved, 21.770514603616135 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 450 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 221 PreInvPairs, 345 NumberOfFragments, 626 HoareAnnotationTreeSize, 221 FomulaSimplifications, 24818 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16864 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s 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...