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_label47_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:15:25,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:15:25,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:15:25,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:15:25,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:15:25,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:15:25,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:15:25,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:15:25,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:15:25,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:15:25,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:15:25,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:15:25,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:15:25,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:15:25,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:15:25,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:15:25,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:15:25,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:15:25,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:15:25,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:15:25,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:15:25,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:15:25,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:15:25,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:15:25,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:15:25,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:15:25,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:15:25,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:15:25,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:15:25,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:15:25,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:15:25,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:15:25,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:15:25,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:15:25,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:15:25,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:15:25,068 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:15:25,101 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:15:25,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:15:25,102 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:15:25,102 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:15:25,102 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:15:25,103 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:15:25,103 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:15:25,103 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:15:25,103 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:15:25,103 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:15:25,103 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:15:25,107 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:15:25,107 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:15:25,108 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:15:25,108 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:15:25,108 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:15:25,108 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:15:25,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:15:25,110 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:15:25,110 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:15:25,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:15:25,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:15:25,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:15:25,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:15:25,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:15:25,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:15:25,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:15:25,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:15:25,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:15:25,112 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:15:25,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:15:25,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:15:25,113 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:15:25,113 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:15:25,113 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:15:25,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:15:25,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:15:25,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:15:25,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:15:25,181 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:15:25,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label47_true-unreach-call_false-termination.c [2018-11-12 17:15:25,248 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86105fca0/232a8d2ce67c43e2b5d3481bd9f9a7f0/FLAGdd1393e86 [2018-11-12 17:15:25,894 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:15:25,896 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label47_true-unreach-call_false-termination.c [2018-11-12 17:15:25,912 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86105fca0/232a8d2ce67c43e2b5d3481bd9f9a7f0/FLAGdd1393e86 [2018-11-12 17:15:25,927 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86105fca0/232a8d2ce67c43e2b5d3481bd9f9a7f0 [2018-11-12 17:15:25,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:15:25,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:15:25,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:15:25,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:15:25,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:15:25,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:15:25" (1/1) ... [2018-11-12 17:15:25,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e2cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:25, skipping insertion in model container [2018-11-12 17:15:25,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:15:25" (1/1) ... [2018-11-12 17:15:25,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:15:26,021 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:15:26,451 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:15:26,456 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:15:26,593 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:15:26,611 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:15:26,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26 WrapperNode [2018-11-12 17:15:26,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:15:26,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:15:26,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:15:26,613 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:15:26,625 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:15:26" (1/1) ... [2018-11-12 17:15:26,732 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:15:26" (1/1) ... [2018-11-12 17:15:26,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:15:26,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:15:26,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:15:26,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:15:26,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (1/1) ... [2018-11-12 17:15:26,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:15:26,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:15:26,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:15:26,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:15:26,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (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:15:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:15:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:15:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:15:26,913 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:15:26,913 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:15:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:15:26,914 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:15:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:15:30,554 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:15:30,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:15:30 BoogieIcfgContainer [2018-11-12 17:15:30,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:15:30,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:15:30,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:15:30,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:15:30,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:15:25" (1/3) ... [2018-11-12 17:15:30,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b26562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:15:30, skipping insertion in model container [2018-11-12 17:15:30,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:26" (2/3) ... [2018-11-12 17:15:30,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b26562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:15:30, skipping insertion in model container [2018-11-12 17:15:30,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:15:30" (3/3) ... [2018-11-12 17:15:30,571 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label47_true-unreach-call_false-termination.c [2018-11-12 17:15:30,582 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:15:30,595 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:15:30,616 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:15:30,674 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:15:30,675 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:15:30,675 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:15:30,675 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:15:30,675 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:15:30,676 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:15:30,676 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:15:30,676 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:15:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-12 17:15:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-12 17:15:30,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:30,726 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] [2018-11-12 17:15:30,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:30,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1596642336, now seen corresponding path program 1 times [2018-11-12 17:15:30,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:30,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:31,329 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:15:31,416 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:15:31,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:31,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:15:31,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:31,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:15:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:15:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:31,450 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-12 17:15:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:33,320 INFO L93 Difference]: Finished difference Result 627 states and 1072 transitions. [2018-11-12 17:15:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:15:33,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-12 17:15:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:33,345 INFO L225 Difference]: With dead ends: 627 [2018-11-12 17:15:33,345 INFO L226 Difference]: Without dead ends: 388 [2018-11-12 17:15:33,353 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:15:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-12 17:15:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 383. [2018-11-12 17:15:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-12 17:15:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 619 transitions. [2018-11-12 17:15:33,473 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 619 transitions. Word has length 114 [2018-11-12 17:15:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:33,474 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 619 transitions. [2018-11-12 17:15:33,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:15:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 619 transitions. [2018-11-12 17:15:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-12 17:15:33,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:33,492 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] [2018-11-12 17:15:33,493 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:33,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash -425024083, now seen corresponding path program 1 times [2018-11-12 17:15:33,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:33,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:33,922 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:15:33,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:33,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:15:33,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:33,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:15:33,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:15:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:15:33,926 INFO L87 Difference]: Start difference. First operand 383 states and 619 transitions. Second operand 5 states. [2018-11-12 17:15:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:35,815 INFO L93 Difference]: Finished difference Result 905 states and 1519 transitions. [2018-11-12 17:15:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:15:35,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2018-11-12 17:15:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:35,821 INFO L225 Difference]: With dead ends: 905 [2018-11-12 17:15:35,822 INFO L226 Difference]: Without dead ends: 382 [2018-11-12 17:15:35,828 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:15:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-12 17:15:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-12 17:15:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-12 17:15:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 613 transitions. [2018-11-12 17:15:35,874 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 613 transitions. Word has length 123 [2018-11-12 17:15:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:35,874 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 613 transitions. [2018-11-12 17:15:35,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:15:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 613 transitions. [2018-11-12 17:15:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-12 17:15:35,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:35,878 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] [2018-11-12 17:15:35,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:35,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 391088041, now seen corresponding path program 1 times [2018-11-12 17:15:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:35,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:35,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:36,135 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-12 17:15:36,192 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:15:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:36,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:15:36,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:36,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:15:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:15:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:15:36,194 INFO L87 Difference]: Start difference. First operand 382 states and 613 transitions. Second operand 6 states. [2018-11-12 17:15:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:39,283 INFO L93 Difference]: Finished difference Result 1241 states and 2101 transitions. [2018-11-12 17:15:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:15:39,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-11-12 17:15:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:39,293 INFO L225 Difference]: With dead ends: 1241 [2018-11-12 17:15:39,293 INFO L226 Difference]: Without dead ends: 865 [2018-11-12 17:15:39,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:15:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-12 17:15:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 818. [2018-11-12 17:15:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-12 17:15:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2018-11-12 17:15:39,343 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 125 [2018-11-12 17:15:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:39,343 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2018-11-12 17:15:39,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:15:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2018-11-12 17:15:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 17:15:39,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:39,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:39,347 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:39,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:39,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2039626074, now seen corresponding path program 1 times [2018-11-12 17:15:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:39,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:39,792 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 17:15:40,030 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-12 17:15:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:15:40,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:40,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:15:40,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:40,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:15:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:15:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:15:40,095 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand 5 states. [2018-11-12 17:15:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:42,450 INFO L93 Difference]: Finished difference Result 1775 states and 2790 transitions. [2018-11-12 17:15:42,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:15:42,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-12 17:15:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:42,461 INFO L225 Difference]: With dead ends: 1775 [2018-11-12 17:15:42,462 INFO L226 Difference]: Without dead ends: 815 [2018-11-12 17:15:42,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:15:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-11-12 17:15:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2018-11-12 17:15:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-11-12 17:15:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1250 transitions. [2018-11-12 17:15:42,504 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1250 transitions. Word has length 139 [2018-11-12 17:15:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:42,505 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1250 transitions. [2018-11-12 17:15:42,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:15:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1250 transitions. [2018-11-12 17:15:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-12 17:15:42,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:42,510 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] [2018-11-12 17:15:42,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:42,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -916026206, now seen corresponding path program 1 times [2018-11-12 17:15:42,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:42,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:42,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:42,956 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 17:15:43,162 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:15:43,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:15:43,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 17:15:43,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:43,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 17:15:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 17:15:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:15:43,163 INFO L87 Difference]: Start difference. First operand 815 states and 1250 transitions. Second operand 5 states. [2018-11-12 17:15:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:15:44,305 INFO L93 Difference]: Finished difference Result 1765 states and 2745 transitions. [2018-11-12 17:15:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 17:15:44,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-12 17:15:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:15:44,311 INFO L225 Difference]: With dead ends: 1765 [2018-11-12 17:15:44,311 INFO L226 Difference]: Without dead ends: 808 [2018-11-12 17:15:44,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 17:15:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-11-12 17:15:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 806. [2018-11-12 17:15:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-12 17:15:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1218 transitions. [2018-11-12 17:15:44,338 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1218 transitions. Word has length 141 [2018-11-12 17:15:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:15:44,338 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1218 transitions. [2018-11-12 17:15:44,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 17:15:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1218 transitions. [2018-11-12 17:15:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-12 17:15:44,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:15:44,342 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:15:44,342 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:15:44,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1064185502, now seen corresponding path program 1 times [2018-11-12 17:15:44,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:15:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:44,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:15:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:15:44,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:15:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:15:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:15:44,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:15:44,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:15:44,494 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-11-12 17:15:44,497 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:15:44,552 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:15:44,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:15:46,033 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:15:46,035 INFO L272 AbstractInterpreter]: Visited 118 different actions 232 times. Merged at 5 different actions 7 times. Never widened. Performed 3294 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3294 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:15:46,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:15:46,079 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:15:46,940 INFO L227 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 81.12% of their original sizes. [2018-11-12 17:15:46,941 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:15:48,609 INFO L415 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2018-11-12 17:15:48,610 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:15:48,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:15:48,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-12 17:15:48,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:15:48,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 17:15:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 17:15:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-12 17:15:48,613 INFO L87 Difference]: Start difference. First operand 806 states and 1218 transitions. Second operand 18 states. [2018-11-12 17:16:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:08,920 INFO L93 Difference]: Finished difference Result 2208 states and 3366 transitions. [2018-11-12 17:16:08,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 17:16:08,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2018-11-12 17:16:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:08,927 INFO L225 Difference]: With dead ends: 2208 [2018-11-12 17:16:08,928 INFO L226 Difference]: Without dead ends: 1408 [2018-11-12 17:16:08,932 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 17:16:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-11-12 17:16:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1398. [2018-11-12 17:16:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2018-11-12 17:16:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1901 transitions. [2018-11-12 17:16:08,978 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1901 transitions. Word has length 149 [2018-11-12 17:16:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:08,979 INFO L480 AbstractCegarLoop]: Abstraction has 1398 states and 1901 transitions. [2018-11-12 17:16:08,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 17:16:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1901 transitions. [2018-11-12 17:16:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 17:16:08,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:08,984 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,985 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:08,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1477998355, now seen corresponding path program 1 times [2018-11-12 17:16:08,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:08,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:08,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:08,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:08,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-12 17:16:09,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:09,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:09,130 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-11-12 17:16:09,130 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [75], [76], [80], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:09,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:09,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:09,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:09,938 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Performed 6819 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6819 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:16:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:09,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:09,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:09,945 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:16:09,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:09,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:10,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 17:16:10,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-12 17:16:10,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:10,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:16:10,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:10,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:16:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:16:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:16:10,691 INFO L87 Difference]: Start difference. First operand 1398 states and 1901 transitions. Second operand 9 states. [2018-11-12 17:16:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:14,700 INFO L93 Difference]: Finished difference Result 5963 states and 8828 transitions. [2018-11-12 17:16:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 17:16:14,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-11-12 17:16:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:14,716 INFO L225 Difference]: With dead ends: 5963 [2018-11-12 17:16:14,716 INFO L226 Difference]: Without dead ends: 2773 [2018-11-12 17:16:14,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:16:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2018-11-12 17:16:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2677. [2018-11-12 17:16:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2677 states. [2018-11-12 17:16:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3262 transitions. [2018-11-12 17:16:14,811 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3262 transitions. Word has length 186 [2018-11-12 17:16:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:14,811 INFO L480 AbstractCegarLoop]: Abstraction has 2677 states and 3262 transitions. [2018-11-12 17:16:14,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:16:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3262 transitions. [2018-11-12 17:16:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-12 17:16:14,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:14,820 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:14,821 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:14,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 732229987, now seen corresponding path program 1 times [2018-11-12 17:16:14,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:14,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:14,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:14,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:15,078 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-12 17:16:15,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:15,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:15,400 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-11-12 17:16:15,400 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], [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], [312], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:15,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:15,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:15,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:15,897 INFO L272 AbstractInterpreter]: Visited 120 different actions 353 times. Merged at 7 different actions 17 times. Never widened. Performed 4810 root evaluator evaluations with a maximum evaluation depth of 4. Performed 4810 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:16:15,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:15,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:15,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:15,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:16:15,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:15,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:15,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:16:16,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-12 17:16:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:16,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-12 17:16:16,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:16,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 17:16:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 17:16:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-12 17:16:16,243 INFO L87 Difference]: Start difference. First operand 2677 states and 3262 transitions. Second operand 8 states. [2018-11-12 17:16:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:16,914 INFO L93 Difference]: Finished difference Result 3088 states and 3709 transitions. [2018-11-12 17:16:16,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 17:16:16,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 209 [2018-11-12 17:16:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:16,921 INFO L225 Difference]: With dead ends: 3088 [2018-11-12 17:16:16,921 INFO L226 Difference]: Without dead ends: 1352 [2018-11-12 17:16:16,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 416 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:16:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2018-11-12 17:16:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1054. [2018-11-12 17:16:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-12 17:16:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1211 transitions. [2018-11-12 17:16:16,955 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1211 transitions. Word has length 209 [2018-11-12 17:16:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:16,956 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 1211 transitions. [2018-11-12 17:16:16,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 17:16:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1211 transitions. [2018-11-12 17:16:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-12 17:16:16,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:16,962 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-12 17:16:16,962 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash 184024359, now seen corresponding path program 1 times [2018-11-12 17:16:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:16,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:16,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:16,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:17,223 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:16:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 122 proven. 96 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 17:16:17,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:17,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:17,427 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-11-12 17:16:17,428 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:17,432 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:17,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:18,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:16:18,403 INFO L272 AbstractInterpreter]: Visited 120 different actions 352 times. Merged at 7 different actions 16 times. Never widened. Performed 4792 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4792 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-12 17:16:18,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:18,443 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:16:18,990 INFO L227 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 80.83% of their original sizes. [2018-11-12 17:16:18,991 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:16:19,193 INFO L415 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2018-11-12 17:16:19,193 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:16:19,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:19,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-11-12 17:16:19,194 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:19,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 17:16:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 17:16:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:16:19,195 INFO L87 Difference]: Start difference. First operand 1054 states and 1211 transitions. Second operand 12 states. [2018-11-12 17:16:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:29,029 INFO L93 Difference]: Finished difference Result 3161 states and 3777 transitions. [2018-11-12 17:16:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 17:16:29,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 241 [2018-11-12 17:16:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:29,039 INFO L225 Difference]: With dead ends: 3161 [2018-11-12 17:16:29,040 INFO L226 Difference]: Without dead ends: 2258 [2018-11-12 17:16:29,043 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2018-11-12 17:16:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2018-11-12 17:16:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2243. [2018-11-12 17:16:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2018-11-12 17:16:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2631 transitions. [2018-11-12 17:16:29,110 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2631 transitions. Word has length 241 [2018-11-12 17:16:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:29,111 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 2631 transitions. [2018-11-12 17:16:29,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 17:16:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2631 transitions. [2018-11-12 17:16:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-12 17:16:29,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:29,121 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-12 17:16:29,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:29,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1507717486, now seen corresponding path program 1 times [2018-11-12 17:16:29,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:29,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:29,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 149 proven. 66 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-12 17:16:29,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:29,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:29,552 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-12 17:16:29,552 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [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], [123], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:29,556 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:29,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:30,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:30,748 INFO L272 AbstractInterpreter]: Visited 123 different actions 616 times. Merged at 9 different actions 53 times. Widened at 1 different actions 2 times. Performed 8114 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8114 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:16:30,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:30,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:30,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:30,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:16:30,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:30,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:30,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 151 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-12 17:16:30,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 149 proven. 66 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-12 17:16:31,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:31,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 17:16:31,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:31,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 17:16:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 17:16:31,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-12 17:16:31,086 INFO L87 Difference]: Start difference. First operand 2243 states and 2631 transitions. Second operand 9 states. [2018-11-12 17:16:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:34,394 INFO L93 Difference]: Finished difference Result 5369 states and 6416 transitions. [2018-11-12 17:16:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 17:16:34,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 255 [2018-11-12 17:16:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:34,409 INFO L225 Difference]: With dead ends: 5369 [2018-11-12 17:16:34,409 INFO L226 Difference]: Without dead ends: 3276 [2018-11-12 17:16:34,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 528 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 17:16:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2018-11-12 17:16:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3040. [2018-11-12 17:16:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3040 states. [2018-11-12 17:16:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 3413 transitions. [2018-11-12 17:16:34,499 INFO L78 Accepts]: Start accepts. Automaton has 3040 states and 3413 transitions. Word has length 255 [2018-11-12 17:16:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:34,500 INFO L480 AbstractCegarLoop]: Abstraction has 3040 states and 3413 transitions. [2018-11-12 17:16:34,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 17:16:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3413 transitions. [2018-11-12 17:16:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-12 17:16:34,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:34,510 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 17:16:34,510 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:34,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 716476800, now seen corresponding path program 1 times [2018-11-12 17:16:34,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:34,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:34,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 71 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-12 17:16:34,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:34,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:34,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-11-12 17:16:34,774 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [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], [174], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:34,777 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:34,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:35,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:35,568 INFO L272 AbstractInterpreter]: Visited 123 different actions 491 times. Merged at 9 different actions 39 times. Widened at 1 different actions 1 times. Performed 6464 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6464 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-12 17:16:35,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:35,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:35,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:35,575 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:16:35,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:35,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:35,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 236 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-12 17:16:36,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 200 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-12 17:16:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:16:36,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-11-12 17:16:36,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:16:36,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 17:16:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 17:16:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-12 17:16:36,401 INFO L87 Difference]: Start difference. First operand 3040 states and 3413 transitions. Second operand 14 states. [2018-11-12 17:16:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:39,888 INFO L93 Difference]: Finished difference Result 7980 states and 9438 transitions. [2018-11-12 17:16:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:16:39,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 266 [2018-11-12 17:16:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:39,906 INFO L225 Difference]: With dead ends: 7980 [2018-11-12 17:16:39,907 INFO L226 Difference]: Without dead ends: 4032 [2018-11-12 17:16:39,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 546 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=422, Invalid=1060, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 17:16:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2018-11-12 17:16:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3316. [2018-11-12 17:16:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-11-12 17:16:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 3729 transitions. [2018-11-12 17:16:40,024 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 3729 transitions. Word has length 266 [2018-11-12 17:16:40,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:40,024 INFO L480 AbstractCegarLoop]: Abstraction has 3316 states and 3729 transitions. [2018-11-12 17:16:40,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 17:16:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 3729 transitions. [2018-11-12 17:16:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-12 17:16:40,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:16:40,037 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:16:40,037 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:16:40,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash -986414215, now seen corresponding path program 1 times [2018-11-12 17:16:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:16:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:16:40,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:16:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 17:16:40,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:40,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:16:40,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-12 17:16:40,538 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [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], [159], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [236], [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], [583], [585], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-12 17:16:40,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:16:40,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:16:41,360 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:16:41,361 INFO L272 AbstractInterpreter]: Visited 123 different actions 607 times. Merged at 9 different actions 45 times. Widened at 1 different actions 1 times. Performed 7449 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7449 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-12 17:16:41,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:16:41,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:16:41,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:16:41,367 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:16:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:16:41,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:16:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:16:41,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:16:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-12 17:16:41,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:16:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-12 17:16:42,249 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:16:42,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-11-12 17:16:42,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:16:42,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:16:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:16:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-12 17:16:42,252 INFO L87 Difference]: Start difference. First operand 3316 states and 3729 transitions. Second operand 3 states. [2018-11-12 17:16:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:16:42,900 INFO L93 Difference]: Finished difference Result 6918 states and 7960 transitions. [2018-11-12 17:16:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:16:42,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-11-12 17:16:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:16:42,902 INFO L225 Difference]: With dead ends: 6918 [2018-11-12 17:16:42,902 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 17:16:42,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-12 17:16:42,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 17:16:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 17:16:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 17:16:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 17:16:42,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 308 [2018-11-12 17:16:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:16:42,920 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 17:16:42,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:16:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 17:16:42,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 17:16:42,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 17:16:43,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,676 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 121 [2018-11-12 17:16:43,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 17:16:43,999 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 134 [2018-11-12 17:16:44,304 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-11-12 17:16:49,933 WARN L179 SmtUtils]: Spent 5.55 s on a formula simplification. DAG size of input: 264 DAG size of output: 82 [2018-11-12 17:16:50,514 WARN L179 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 49 [2018-11-12 17:16:51,043 WARN L179 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 49 [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,047 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,047 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-12 17:16:51,048 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-12 17:16:51,049 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-12 17:16:51,050 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-12 17:16:51,051 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,052 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-12 17:16:51,053 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,054 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-12 17:16:51,055 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-12 17:16:51,056 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-12 17:16:51,057 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-12 17:16:51,058 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,059 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-12 17:16:51,060 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 493) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,061 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-12 17:16:51,062 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,063 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,064 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse21 (= 1 |old(~a11~0)|)) (.cse8 (= 1 |old(~a25~0)|))) (let ((.cse9 (< 7 |old(~a17~0)|)) (.cse3 (not (= ~a25~0 1))) (.cse11 (= ~a11~0 |old(~a11~0)|)) (.cse6 (< 8 |old(~a17~0)|)) (.cse1 (< |old(~a17~0)| 8)) (.cse10 (<= ~a17~0 |old(~a17~0)|)) (.cse18 (= |old(~a11~0)| |old(~a19~0)|)) (.cse13 (not (= 1 |old(~a19~0)|))) (.cse15 (= 1 ~a25~0)) (.cse16 (= 8 ~a17~0)) (.cse17 (= 1 ~a19~0)) (.cse14 (not (= 8 |old(~a17~0)|))) (.cse5 (= |old(~a17~0)| ~a17~0)) (.cse2 (= |old(~a19~0)| ~a19~0)) (.cse4 (= 1 ~a11~0)) (.cse19 (= ~a28~0 |old(~a28~0)|)) (.cse20 (= ~a25~0 |old(~a25~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse12 (not .cse8)) (.cse7 (not .cse21))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8) (or .cse0 .cse9 (and .cse10 .cse2 .cse11)) (or .cse0 .cse12 .cse13 .cse14 (and .cse4 .cse15 (= 9 ~a28~0) .cse16 .cse17) (not (= 9 |old(~a28~0)|)) .cse7) (or .cse0 .cse3 .cse9 .cse8) (or .cse0 .cse3 .cse18 .cse7 .cse8) (or (and .cse11 .cse5 .cse2 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse6)) (or .cse0 .cse1 (and .cse10 .cse2 (<= 8 ~a17~0) .cse4) .cse18 .cse7) (or .cse0 (and (= 7 ~a28~0) (= 7 ~a17~0) .cse15) (not (= 7 |old(~a28~0)|)) .cse12 .cse13 .cse7 (not (= 7 |old(~a17~0)|))) (or .cse0 (not (= 10 |old(~a28~0)|)) .cse12 .cse13 (and .cse4 .cse15 .cse16 .cse17 (= 10 ~a28~0)) .cse14 .cse7) (or (and .cse5 .cse2 .cse4 .cse19 .cse20) .cse0 (< 7 |old(~a28~0)|) .cse12 (not (= |old(~a17~0)| 8)) .cse7)))) [2018-11-12 17:16:51,064 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,064 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,064 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,064 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-12 17:16:51,064 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-12 17:16:51,064 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-12 17:16:51,065 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-12 17:16:51,066 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-12 17:16:51,067 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-12 17:16:51,068 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-12 17:16:51,069 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:51,070 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-12 17:16:51,070 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-12 17:16:51,070 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-12 17:16:51,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,070 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-12 17:16:51,070 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 17:16:51,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 17:16:51,070 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a11~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-11-12 17:16:51,071 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-12 17:16:51,071 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= 8 ~a17~0)) (.cse0 (= 1 ~a11~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (<= ~a28~0 7) .cse0 .cse1) (<= ~a17~0 7) (and .cse0 (= 9 ~a28~0) .cse2) (not (= 0 |old(~a25~0)|)) (and (= ~a11~0 |old(~a11~0)|) .cse1) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse0 .cse1) (and .cse0 .cse2 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)) (and (<= ~a17~0 |old(~a17~0)|) .cse0 (not (= ~a19~0 ~a11~0))))) [2018-11-12 17:16:51,071 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:51,071 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-12 17:16:51,071 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (<= ~a17~0 8)) (.cse2 (= 8 ~a17~0)) (.cse0 (= 1 ~a11~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (<= ~a28~0 7) .cse0 .cse1) (<= ~a17~0 7) (and .cse0 (= 9 ~a28~0) .cse2) (not (= 0 |old(~a25~0)|)) (and (= ~a11~0 |old(~a11~0)|) .cse1) (not (= 1 |old(~a19~0)|)) (and (not (= ~a25~0 1)) .cse0 .cse1) (and .cse0 .cse2 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)) (and (<= ~a17~0 |old(~a17~0)|) .cse0 (not (= ~a19~0 ~a11~0))))) [2018-11-12 17:16:51,071 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-12 17:16:51,071 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-12 17:16:51,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:16:51 BoogieIcfgContainer [2018-11-12 17:16:51,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:16:51,087 INFO L168 Benchmark]: Toolchain (without parser) took 85149.47 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,088 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:16:51,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.68 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:16:51,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,091 INFO L168 Benchmark]: Boogie Preprocessor took 94.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:16:51,092 INFO L168 Benchmark]: RCFGBuilder took 3717.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,093 INFO L168 Benchmark]: TraceAbstraction took 80529.96 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -962.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-12 17:16:51,099 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 672.68 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 128.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.97 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3717.75 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 102.8 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80529.96 ms. Allocated memory was 2.3 GB in the beginning and 3.8 GB in the end (delta: 1.5 GB). Free memory was 2.1 GB in the beginning and 3.1 GB in the end (delta: -962.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 493]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || ((a28 <= 7 && 1 == a11) && a17 <= 8)) || a17 <= 7) || ((1 == a11 && 9 == a28) && 8 == a17)) || !(0 == \old(a25))) || (a11 == \old(a11) && a17 <= 8)) || !(1 == \old(a19))) || ((!(a25 == 1) && 1 == a11) && a17 <= 8)) || ((1 == a11 && 8 == a17) && 10 == a28)) || !(8 == \old(a17))) || ((a17 <= \old(a17) && 1 == a11) && !(a19 == a11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 80.4s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 52.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1237 SDtfs, 11943 SDslu, 2109 SDs, 0 SdLazy, 16200 SolverSat, 2845 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3050 GetRequests, 2862 SyntacticMatches, 11 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3316occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.7s AbstIntTime, 7 AbstIntIterations, 2 AbstIntStrong, 0.9972045119710375 AbsIntWeakeningRatio, 0.1958762886597938 AbsIntAvgWeakeningVarsNumRemoved, 28.951030927835053 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 1425 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 146 PreInvPairs, 242 NumberOfFragments, 556 HoareAnnotationTreeSize, 146 FomulaSimplifications, 24794 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 11287 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3480 NumberOfCodeBlocks, 3480 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4682 ConstructedInterpolants, 0 QuantifiedInterpolants, 2454365 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2912 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 3776/4155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...