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/Problem01_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:40:39,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:40:39,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:40:39,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:40:39,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:40:39,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:40:39,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:40:39,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:40:39,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:40:39,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:40:39,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:40:39,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:40:39,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:40:39,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:40:39,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:40:39,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:40:39,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:40:39,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:40:39,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:40:39,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:40:39,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:40:39,620 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:40:39,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:40:39,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:40:39,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:40:39,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:40:39,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:40:39,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:40:39,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:40:39,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:40:39,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:40:39,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:40:39,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:40:39,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:40:39,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:40:39,636 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:40:39,637 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-07 18:40:39,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:40:39,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:40:39,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:40:39,667 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:40:39,667 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:40:39,667 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:40:39,668 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:40:39,668 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:40:39,668 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:40:39,668 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:40:39,668 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:40:39,668 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:40:39,669 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:40:39,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:40:39,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:40:39,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:40:39,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:40:39,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:40:39,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:40:39,672 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:40:39,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:40:39,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:40:39,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:40:39,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:40:39,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:40:39,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:40:39,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:40:39,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:40:39,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:40:39,674 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:40:39,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:40:39,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:40:39,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:40:39,675 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:40:39,675 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:40:39,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:40:39,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:40:39,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:40:39,752 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:40:39,752 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:40:39,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-11-07 18:40:39,813 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e146b1032/638f72b70baf41fcac789db0cab21dad/FLAGefc480eb1 [2018-11-07 18:40:40,345 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:40:40,346 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-11-07 18:40:40,368 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e146b1032/638f72b70baf41fcac789db0cab21dad/FLAGefc480eb1 [2018-11-07 18:40:40,382 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e146b1032/638f72b70baf41fcac789db0cab21dad [2018-11-07 18:40:40,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:40:40,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:40:40,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:40,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:40:40,399 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:40:40,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:40" (1/1) ... [2018-11-07 18:40:40,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4165a42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:40, skipping insertion in model container [2018-11-07 18:40:40,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:40" (1/1) ... [2018-11-07 18:40:40,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:40:40,478 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:40:41,057 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:41,063 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:40:41,183 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:40:41,204 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:40:41,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41 WrapperNode [2018-11-07 18:40:41,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:40:41,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:41,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:40:41,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:40:41,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:40:41,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:40:41,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:40:41,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:40:41,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (1/1) ... [2018-11-07 18:40:41,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:40:41,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:40:41,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:40:41,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:40:41,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (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-07 18:40:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:40:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:40:41,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:40:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:40:41,562 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:40:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:40:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:40:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:40:41,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:40:44,840 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:40:44,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:44 BoogieIcfgContainer [2018-11-07 18:40:44,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:40:44,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:40:44,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:40:44,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:40:44,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:40:40" (1/3) ... [2018-11-07 18:40:44,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768f5076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:44, skipping insertion in model container [2018-11-07 18:40:44,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:41" (2/3) ... [2018-11-07 18:40:44,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768f5076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:44, skipping insertion in model container [2018-11-07 18:40:44,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:44" (3/3) ... [2018-11-07 18:40:44,850 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2018-11-07 18:40:44,859 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:40:44,867 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:40:44,880 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:40:44,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:40:44,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:40:44,919 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:40:44,919 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:40:44,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:40:44,919 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:40:44,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:40:44,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:40:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 18:40:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-07 18:40:44,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:44,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:44,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:44,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:44,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2071841880, now seen corresponding path program 1 times [2018-11-07 18:40:44,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:45,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:45,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:45,773 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-07 18:40:45,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:45,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 18:40:45,776 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:45,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 18:40:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 18:40:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:40:45,802 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2018-11-07 18:40:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:48,144 INFO L93 Difference]: Finished difference Result 702 states and 1227 transitions. [2018-11-07 18:40:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:40:48,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-11-07 18:40:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:48,172 INFO L225 Difference]: With dead ends: 702 [2018-11-07 18:40:48,172 INFO L226 Difference]: Without dead ends: 488 [2018-11-07 18:40:48,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 18:40:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-07 18:40:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 340. [2018-11-07 18:40:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 18:40:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-11-07 18:40:48,254 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 132 [2018-11-07 18:40:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:48,256 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-11-07 18:40:48,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 18:40:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-11-07 18:40:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 18:40:48,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:48,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:48,264 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:48,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1746853559, now seen corresponding path program 1 times [2018-11-07 18:40:48,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:48,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:48,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:48,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:48,544 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:40:48,636 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-07 18:40:48,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:40:48,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:48,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:40:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:40:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:40:48,640 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 6 states. [2018-11-07 18:40:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:50,250 INFO L93 Difference]: Finished difference Result 882 states and 1513 transitions. [2018-11-07 18:40:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:40:50,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-07 18:40:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:50,258 INFO L225 Difference]: With dead ends: 882 [2018-11-07 18:40:50,258 INFO L226 Difference]: Without dead ends: 548 [2018-11-07 18:40:50,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-11-07 18:40:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 531. [2018-11-07 18:40:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-11-07 18:40:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 836 transitions. [2018-11-07 18:40:50,308 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 836 transitions. Word has length 143 [2018-11-07 18:40:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:50,309 INFO L480 AbstractCegarLoop]: Abstraction has 531 states and 836 transitions. [2018-11-07 18:40:50,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:40:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 836 transitions. [2018-11-07 18:40:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 18:40:50,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:50,314 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:50,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:50,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1493139701, now seen corresponding path program 1 times [2018-11-07 18:40:50,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:50,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:50,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:50,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:50,895 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 18:40:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:51,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:40:51,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:40:51,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:40:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:40:51,062 INFO L87 Difference]: Start difference. First operand 531 states and 836 transitions. Second operand 5 states. [2018-11-07 18:40:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:53,147 INFO L93 Difference]: Finished difference Result 1192 states and 1911 transitions. [2018-11-07 18:40:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:40:53,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-11-07 18:40:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:53,152 INFO L225 Difference]: With dead ends: 1192 [2018-11-07 18:40:53,153 INFO L226 Difference]: Without dead ends: 528 [2018-11-07 18:40:53,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:40:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-11-07 18:40:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-11-07 18:40:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-07 18:40:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 782 transitions. [2018-11-07 18:40:53,180 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 782 transitions. Word has length 144 [2018-11-07 18:40:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:53,180 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 782 transitions. [2018-11-07 18:40:53,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:40:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 782 transitions. [2018-11-07 18:40:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-07 18:40:53,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:53,185 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:40:53,185 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:53,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1935386109, now seen corresponding path program 1 times [2018-11-07 18:40:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:53,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:53,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:53,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:40:53,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:53,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:40:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:40:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:53,377 INFO L87 Difference]: Start difference. First operand 528 states and 782 transitions. Second operand 3 states. [2018-11-07 18:40:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:54,849 INFO L93 Difference]: Finished difference Result 1493 states and 2284 transitions. [2018-11-07 18:40:54,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:40:54,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-11-07 18:40:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:54,860 INFO L225 Difference]: With dead ends: 1493 [2018-11-07 18:40:54,860 INFO L226 Difference]: Without dead ends: 971 [2018-11-07 18:40:54,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:40:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-11-07 18:40:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2018-11-07 18:40:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2018-11-07 18:40:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1393 transitions. [2018-11-07 18:40:54,915 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1393 transitions. Word has length 148 [2018-11-07 18:40:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:54,917 INFO L480 AbstractCegarLoop]: Abstraction has 971 states and 1393 transitions. [2018-11-07 18:40:54,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:40:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1393 transitions. [2018-11-07 18:40:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-07 18:40:54,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:54,922 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:40:54,922 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:54,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1185891811, now seen corresponding path program 1 times [2018-11-07 18:40:54,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:54,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:54,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:55,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:40:55,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:40:55,146 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:55,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:40:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:40:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:40:55,147 INFO L87 Difference]: Start difference. First operand 971 states and 1393 transitions. Second operand 6 states. [2018-11-07 18:40:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:40:56,643 INFO L93 Difference]: Finished difference Result 2867 states and 4269 transitions. [2018-11-07 18:40:56,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:40:56,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-07 18:40:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:40:56,665 INFO L225 Difference]: With dead ends: 2867 [2018-11-07 18:40:56,665 INFO L226 Difference]: Without dead ends: 1902 [2018-11-07 18:40:56,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:40:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2018-11-07 18:40:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1873. [2018-11-07 18:40:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2018-11-07 18:40:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2527 transitions. [2018-11-07 18:40:56,754 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2527 transitions. Word has length 164 [2018-11-07 18:40:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:40:56,755 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 2527 transitions. [2018-11-07 18:40:56,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:40:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2527 transitions. [2018-11-07 18:40:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-07 18:40:56,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:40:56,766 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:40:56,766 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:40:56,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash -151226562, now seen corresponding path program 1 times [2018-11-07 18:40:56,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:40:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:40:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:40:56,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:40:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:40:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:40:57,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:40:57,007 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:40:57,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-11-07 18:40:57,010 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:40:57,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:40:57,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:40:57,809 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:40:57,812 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 18:40:57,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:40:57,856 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:40:58,502 INFO L227 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 79.63% of their original sizes. [2018-11-07 18:40:58,503 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:40:59,784 INFO L415 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-11-07 18:40:59,784 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:40:59,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:40:59,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 18:40:59,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:40:59,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 18:40:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 18:40:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:40:59,787 INFO L87 Difference]: Start difference. First operand 1873 states and 2527 transitions. Second operand 12 states. [2018-11-07 18:41:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:10,040 INFO L93 Difference]: Finished difference Result 3801 states and 5131 transitions. [2018-11-07 18:41:10,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:41:10,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2018-11-07 18:41:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:10,051 INFO L225 Difference]: With dead ends: 3801 [2018-11-07 18:41:10,051 INFO L226 Difference]: Without dead ends: 1934 [2018-11-07 18:41:10,058 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:41:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2018-11-07 18:41:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2018-11-07 18:41:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-11-07 18:41:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2593 transitions. [2018-11-07 18:41:10,113 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2593 transitions. Word has length 177 [2018-11-07 18:41:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:10,113 INFO L480 AbstractCegarLoop]: Abstraction has 1934 states and 2593 transitions. [2018-11-07 18:41:10,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 18:41:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2593 transitions. [2018-11-07 18:41:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-07 18:41:10,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:10,122 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:41:10,123 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:10,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1836874565, now seen corresponding path program 1 times [2018-11-07 18:41:10,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:10,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:10,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:10,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 18:41:10,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:10,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:10,377 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-11-07 18:41:10,377 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:10,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:10,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:10,840 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:10,841 INFO L272 AbstractInterpreter]: Visited 137 different actions 204 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:41:10,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:10,881 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:11,656 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 81.42% of their original sizes. [2018-11-07 18:41:11,656 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:13,000 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-11-07 18:41:13,001 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:13,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:13,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 18:41:13,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:13,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 18:41:13,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 18:41:13,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 18:41:13,002 INFO L87 Difference]: Start difference. First operand 1934 states and 2593 transitions. Second operand 19 states. [2018-11-07 18:41:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:30,803 INFO L93 Difference]: Finished difference Result 4086 states and 5507 transitions. [2018-11-07 18:41:30,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 18:41:30,803 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2018-11-07 18:41:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:30,814 INFO L225 Difference]: With dead ends: 4086 [2018-11-07 18:41:30,814 INFO L226 Difference]: Without dead ends: 2219 [2018-11-07 18:41:30,821 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 18:41:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2018-11-07 18:41:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2208. [2018-11-07 18:41:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2018-11-07 18:41:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2887 transitions. [2018-11-07 18:41:30,881 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2887 transitions. Word has length 186 [2018-11-07 18:41:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:30,881 INFO L480 AbstractCegarLoop]: Abstraction has 2208 states and 2887 transitions. [2018-11-07 18:41:30,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 18:41:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2887 transitions. [2018-11-07 18:41:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 18:41:30,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:30,891 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 18:41:30,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:30,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash -315492441, now seen corresponding path program 1 times [2018-11-07 18:41:30,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:30,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 18:41:31,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:31,080 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:31,080 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 18:41:31,081 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:31,085 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:31,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:31,471 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:31,471 INFO L272 AbstractInterpreter]: Visited 137 different actions 204 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:41:31,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:31,476 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:32,561 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 81.19% of their original sizes. [2018-11-07 18:41:32,562 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:34,037 INFO L415 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2018-11-07 18:41:34,038 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:34,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:34,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-07 18:41:34,038 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:34,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 18:41:34,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 18:41:34,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-07 18:41:34,040 INFO L87 Difference]: Start difference. First operand 2208 states and 2887 transitions. Second operand 25 states. [2018-11-07 18:41:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:41:52,750 INFO L93 Difference]: Finished difference Result 4495 states and 5929 transitions. [2018-11-07 18:41:52,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 18:41:52,750 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 219 [2018-11-07 18:41:52,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:41:52,762 INFO L225 Difference]: With dead ends: 4495 [2018-11-07 18:41:52,762 INFO L226 Difference]: Without dead ends: 2628 [2018-11-07 18:41:52,771 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 189 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 18:41:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2018-11-07 18:41:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2346. [2018-11-07 18:41:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2018-11-07 18:41:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3029 transitions. [2018-11-07 18:41:52,845 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3029 transitions. Word has length 219 [2018-11-07 18:41:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:41:52,845 INFO L480 AbstractCegarLoop]: Abstraction has 2346 states and 3029 transitions. [2018-11-07 18:41:52,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 18:41:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3029 transitions. [2018-11-07 18:41:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-07 18:41:52,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:41:52,856 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:41:52,857 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:41:52,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1938544868, now seen corresponding path program 1 times [2018-11-07 18:41:52,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:41:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:52,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:41:52,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:41:52,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:41:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:41:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 95 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-07 18:41:53,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:41:53,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:41:53,584 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-11-07 18:41:53,585 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:41:53,591 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:41:53,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:41:54,659 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:41:54,660 INFO L272 AbstractInterpreter]: Visited 138 different actions 621 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:41:54,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:41:54,663 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:41:54,999 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 80.51% of their original sizes. [2018-11-07 18:41:55,000 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:41:55,107 INFO L415 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2018-11-07 18:41:55,107 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:41:55,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:41:55,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 18:41:55,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:41:55,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:41:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:41:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:41:55,109 INFO L87 Difference]: Start difference. First operand 2346 states and 3029 transitions. Second operand 11 states. [2018-11-07 18:42:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:02,069 INFO L93 Difference]: Finished difference Result 5453 states and 7253 transitions. [2018-11-07 18:42:02,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 18:42:02,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2018-11-07 18:42:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:02,084 INFO L225 Difference]: With dead ends: 5453 [2018-11-07 18:42:02,085 INFO L226 Difference]: Without dead ends: 3586 [2018-11-07 18:42:02,093 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-11-07 18:42:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2018-11-07 18:42:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3526. [2018-11-07 18:42:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-11-07 18:42:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4512 transitions. [2018-11-07 18:42:02,195 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4512 transitions. Word has length 228 [2018-11-07 18:42:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:02,195 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 4512 transitions. [2018-11-07 18:42:02,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4512 transitions. [2018-11-07 18:42:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-07 18:42:02,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:02,209 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:02,209 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:02,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:02,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1391516712, now seen corresponding path program 1 times [2018-11-07 18:42:02,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:02,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:02,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:02,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:02,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:42:02,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:02,662 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:02,662 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-11-07 18:42:02,662 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:02,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:02,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:04,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:42:04,540 INFO L272 AbstractInterpreter]: Visited 139 different actions 634 times. Merged at 9 different actions 50 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:42:04,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:04,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:42:04,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:04,543 INFO L194 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-07 18:42:04,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:04,554 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:42:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:04,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:42:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 18:42:05,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:42:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 18:42:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:42:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:42:06,207 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:42:06,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:42:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:42:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:42:06,208 INFO L87 Difference]: Start difference. First operand 3526 states and 4512 transitions. Second operand 11 states. [2018-11-07 18:42:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:09,179 INFO L93 Difference]: Finished difference Result 7871 states and 10154 transitions. [2018-11-07 18:42:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 18:42:09,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 231 [2018-11-07 18:42:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:09,198 INFO L225 Difference]: With dead ends: 7871 [2018-11-07 18:42:09,199 INFO L226 Difference]: Without dead ends: 4550 [2018-11-07 18:42:09,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 463 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:42:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2018-11-07 18:42:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4389. [2018-11-07 18:42:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2018-11-07 18:42:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 5469 transitions. [2018-11-07 18:42:09,357 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 5469 transitions. Word has length 231 [2018-11-07 18:42:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:09,358 INFO L480 AbstractCegarLoop]: Abstraction has 4389 states and 5469 transitions. [2018-11-07 18:42:09,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 5469 transitions. [2018-11-07 18:42:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-07 18:42:09,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:09,375 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 18:42:09,375 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:09,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1555977894, now seen corresponding path program 1 times [2018-11-07 18:42:09,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:09,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:09,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:09,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:42:09,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:09,752 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:09,752 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-11-07 18:42:09,752 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:09,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:09,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:10,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:42:10,794 INFO L272 AbstractInterpreter]: Visited 138 different actions 342 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 18:42:10,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:10,820 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:42:11,377 INFO L227 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 80.48% of their original sizes. [2018-11-07 18:42:11,377 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:42:11,982 INFO L415 sIntCurrentIteration]: We unified 239 AI predicates to 239 [2018-11-07 18:42:11,982 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:42:11,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:42:11,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 18:42:11,983 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:42:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:42:11,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:42:11,984 INFO L87 Difference]: Start difference. First operand 4389 states and 5469 transitions. Second operand 11 states. [2018-11-07 18:42:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:16,634 INFO L93 Difference]: Finished difference Result 8577 states and 10760 transitions. [2018-11-07 18:42:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 18:42:16,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-11-07 18:42:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:16,648 INFO L225 Difference]: With dead ends: 8577 [2018-11-07 18:42:16,649 INFO L226 Difference]: Without dead ends: 4531 [2018-11-07 18:42:16,659 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 18:42:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2018-11-07 18:42:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4527. [2018-11-07 18:42:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4527 states. [2018-11-07 18:42:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 5618 transitions. [2018-11-07 18:42:16,775 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 5618 transitions. Word has length 240 [2018-11-07 18:42:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:16,775 INFO L480 AbstractCegarLoop]: Abstraction has 4527 states and 5618 transitions. [2018-11-07 18:42:16,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 5618 transitions. [2018-11-07 18:42:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-07 18:42:16,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:16,793 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:16,793 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:16,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2058234151, now seen corresponding path program 1 times [2018-11-07 18:42:16,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:16,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:16,795 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:17,318 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 18:42:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 18:42:17,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:17,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:17,401 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-11-07 18:42:17,401 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:17,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:17,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:17,742 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:42:17,742 INFO L272 AbstractInterpreter]: Visited 137 different actions 204 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 18:42:17,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:17,773 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:42:18,323 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 80.39% of their original sizes. [2018-11-07 18:42:18,323 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:42:18,628 INFO L415 sIntCurrentIteration]: We unified 243 AI predicates to 243 [2018-11-07 18:42:18,628 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:42:18,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:42:18,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 18:42:18,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:18,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 18:42:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 18:42:18,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 18:42:18,630 INFO L87 Difference]: Start difference. First operand 4527 states and 5618 transitions. Second operand 18 states. [2018-11-07 18:42:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:26,898 INFO L93 Difference]: Finished difference Result 8712 states and 10899 transitions. [2018-11-07 18:42:26,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 18:42:26,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 244 [2018-11-07 18:42:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:26,915 INFO L225 Difference]: With dead ends: 8712 [2018-11-07 18:42:26,915 INFO L226 Difference]: Without dead ends: 4666 [2018-11-07 18:42:26,926 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-11-07 18:42:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2018-11-07 18:42:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4665. [2018-11-07 18:42:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2018-11-07 18:42:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 5763 transitions. [2018-11-07 18:42:27,035 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 5763 transitions. Word has length 244 [2018-11-07 18:42:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:27,035 INFO L480 AbstractCegarLoop]: Abstraction has 4665 states and 5763 transitions. [2018-11-07 18:42:27,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 18:42:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 5763 transitions. [2018-11-07 18:42:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 18:42:27,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:27,052 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:42:27,053 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:27,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1877827066, now seen corresponding path program 1 times [2018-11-07 18:42:27,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:27,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 120 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 18:42:27,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:27,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:27,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 18:42:27,712 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:27,715 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:27,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:28,474 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:42:28,475 INFO L272 AbstractInterpreter]: Visited 138 different actions 345 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 18:42:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:28,480 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:42:28,906 INFO L227 lantSequenceWeakener]: Weakened 250 states. On average, predicates are now at 80.46% of their original sizes. [2018-11-07 18:42:28,906 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:42:29,024 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 18:42:29,024 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:42:29,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:42:29,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 18:42:29,025 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:42:29,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:42:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:42:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:42:29,026 INFO L87 Difference]: Start difference. First operand 4665 states and 5763 transitions. Second operand 11 states. [2018-11-07 18:42:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:36,432 INFO L93 Difference]: Finished difference Result 9557 states and 11882 transitions. [2018-11-07 18:42:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 18:42:36,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 253 [2018-11-07 18:42:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:36,448 INFO L225 Difference]: With dead ends: 9557 [2018-11-07 18:42:36,448 INFO L226 Difference]: Without dead ends: 5373 [2018-11-07 18:42:36,459 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 18:42:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2018-11-07 18:42:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 5354. [2018-11-07 18:42:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5354 states. [2018-11-07 18:42:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 6514 transitions. [2018-11-07 18:42:36,581 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 6514 transitions. Word has length 253 [2018-11-07 18:42:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:36,582 INFO L480 AbstractCegarLoop]: Abstraction has 5354 states and 6514 transitions. [2018-11-07 18:42:36,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 6514 transitions. [2018-11-07 18:42:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-07 18:42:36,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:42:36,600 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 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] [2018-11-07 18:42:36,600 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:42:36,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1297069620, now seen corresponding path program 1 times [2018-11-07 18:42:36,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:42:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:42:36,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:42:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 175 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 18:42:37,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:37,262 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:42:37,262 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-07 18:42:37,263 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 18:42:37,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:42:37,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:42:44,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:42:44,695 INFO L272 AbstractInterpreter]: Visited 139 different actions 3307 times. Merged at 9 different actions 291 times. Widened at 1 different actions 21 times. Found 67 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 18:42:44,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:42:44,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:42:44,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:42:44,702 INFO L194 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-07 18:42:44,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:42:44,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:42:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:42:44,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:42:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 166 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 18:42:44,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:42:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 191 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-07 18:42:45,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:42:45,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-07 18:42:45,518 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:42:45,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:42:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:42:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-07 18:42:45,520 INFO L87 Difference]: Start difference. First operand 5354 states and 6514 transitions. Second operand 11 states. [2018-11-07 18:42:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:42:50,728 INFO L93 Difference]: Finished difference Result 12149 states and 16893 transitions. [2018-11-07 18:42:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 18:42:50,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 256 [2018-11-07 18:42:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:42:50,729 INFO L225 Difference]: With dead ends: 12149 [2018-11-07 18:42:50,729 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:42:50,784 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 530 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=1390, Unknown=0, NotChecked=0, Total=1722 [2018-11-07 18:42:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:42:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:42:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:42:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:42:50,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2018-11-07 18:42:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:42:50,785 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:42:50,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:42:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:42:50,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:42:50,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:42:50,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:51,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:51,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:52,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,780 WARN L179 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 403 DAG size of output: 288 [2018-11-07 18:42:53,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:53,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:42:54,631 WARN L179 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 217 [2018-11-07 18:42:55,690 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-11-07 18:42:56,614 WARN L179 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 86 [2018-11-07 18:43:00,020 WARN L179 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 357 DAG size of output: 198 [2018-11-07 18:43:01,852 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 317 DAG size of output: 117 [2018-11-07 18:43:03,108 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 246 DAG size of output: 120 [2018-11-07 18:43:03,112 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:43:03,112 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-07 18:43:03,112 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:43:03,112 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 18:43:03,112 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 18:43:03,113 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,114 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 18:43:03,115 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 18:43:03,116 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 18:43:03,117 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 18:43:03,118 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 18:43:03,119 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 18:43:03,120 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,121 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 18:43:03,122 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 18:43:03,123 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse38 (= 1 |old(~a17~0)|))) (let ((.cse31 (< 6 |old(~a16~0)|)) (.cse6 (not (= 1 |old(~a20~0)|))) (.cse34 (< |old(~a16~0)| 4)) (.cse11 (< 1 |old(~a17~0)|)) (.cse25 (not (= 0 |old(~a7~0)|))) (.cse20 (not (= 1 |old(~a21~0)|))) (.cse30 (not (= 15 |old(~a8~0)|))) (.cse8 (not (= 8 ~a12~0))) (.cse24 (not .cse38)) (.cse26 (<= ~a17~0 1)) (.cse29 (let ((.cse39 (<= 0 ~a17~0)) (.cse40 (= ~a21~0 1)) (.cse41 (<= ~a8~0 15))) (or (and .cse39 (<= 13 ~a8~0) (<= 4 ~a16~0) .cse40 .cse41) (and (not (= ~a16~0 0)) .cse39 (<= 0 ~a20~0) .cse40 .cse41)))) (.cse27 (= ~a7~0 |old(~a7~0)|)) (.cse28 (= |old(~a8~0)| ~a8~0)) (.cse36 (= |old(~a20~0)| ~a20~0)) (.cse37 (<= ~a21~0 |old(~a21~0)|)) (.cse22 (= |old(~a16~0)| ~a16~0)) (.cse23 (= 1 ~a17~0))) (let ((.cse15 (and (= |old(~a7~0)| |old(~a17~0)|) .cse38)) (.cse14 (and .cse27 .cse28 .cse36 .cse37 .cse22 (or (not (= ~a7~0 ~a17~0)) (not .cse23)))) (.cse12 (and .cse26 .cse29)) (.cse4 (and (or .cse25 .cse20 .cse6 .cse30 (< 5 |old(~a16~0)|) .cse34 .cse8 .cse11) (or .cse25 .cse20 .cse30 (not (= 0 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) .cse8 .cse24))) (.cse7 (= 13 |old(~a8~0)|)) (.cse5 (= 1 |old(~a7~0)|)) (.cse18 (not (= 4 |old(~a16~0)|))) (.cse19 (= ~a17~0 1)) (.cse13 (= 6 |old(~a16~0)|)) (.cse17 (< 0 |old(~a21~0)|)) (.cse16 (< 0 |old(~a20~0)|)) (.cse9 (and .cse27 .cse28 .cse36 .cse37 .cse22)) (.cse10 (let ((.cse32 (< 15 |old(~a8~0)|)) (.cse33 (< 1 |old(~a20~0)|)) (.cse35 (< |old(~a17~0)| 0))) (and (or .cse25 .cse20 .cse32 (< (+ |old(~a20~0)| 1) 0) .cse8 .cse33 .cse31 .cse34 .cse35 (< |old(~a8~0)| 13)) (or .cse25 .cse20 .cse32 (< |old(~a8~0)| 8) .cse8 .cse33 (< |old(~a20~0)| 0) (< |old(~a16~0)| 3) .cse31 .cse35)))) (.cse21 (= 1 ~a20~0)) (.cse2 (< 6 |calculate_output_#in~input|)) (.cse3 (not (= 0 |old(~a17~0)|))) (.cse0 (= ~a17~0 0)) (.cse1 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse7 .cse10 .cse11 .cse12 .cse1) (or .cse13 .cse6 .cse14 .cse7 .cse15 .cse8) (or .cse13 .cse7 .cse15 .cse8 .cse14 .cse16) (or .cse6 .cse15 .cse8 .cse17 .cse14) (or .cse2 .cse12 .cse18 .cse10 .cse11 .cse1) (or .cse19 .cse1 .cse16 .cse2 .cse4) (or .cse20 .cse6 .cse18 (and (= 1 ~a7~0) .cse21 (= 13 ~a8~0) .cse22 (= 1 ~a21~0) .cse23) .cse8 (not .cse5) (not .cse7) .cse24) (or .cse13 .cse6 .cse9 .cse8 .cse17) (or .cse5 .cse7 .cse8 .cse9 .cse16) (or .cse5 .cse18 .cse8 .cse9 .cse16) (or .cse19 (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse1 .cse25 .cse2 (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse13 .cse8 .cse17 .cse16 .cse9) (or .cse2 .cse10 .cse11 .cse6 (and .cse21 .cse26 .cse27 .cse28 .cse29 (= ~a16~0 |old(~a16~0)|)) .cse1) (or .cse2 (or .cse25 .cse20 (< |old(~a16~0)| 5) .cse30 .cse3 .cse8) .cse31 .cse6 .cse0 .cse1))))) [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 18:43:03,124 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 18:43:03,125 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,126 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:43:03,127 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 18:43:03,127 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:43:03,127 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:43:03,128 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (and (= ~a21~0 1) (= ~a8~0 15) (= ~a16~0 |old(~a16~0)|) (= ~a17~0 1) (= ~a7~0 0) (= ~a20~0 1)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 18:43:03,128 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:43:03,128 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse8 (= 1 ~a17~0))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse3 (<= ~a21~0 0)) (.cse5 (= |old(~a20~0)| ~a20~0)) (.cse7 (= 1 ~a20~0)) (.cse4 (not (= ~a16~0 6))) (.cse6 (or (not (= ~a7~0 ~a17~0)) (not .cse8))) (.cse1 (not (= ~a8~0 13)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 (= ~a16~0 4) .cse2) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= ~a7~0 0) .cse5 (<= 1 main_~input~0) (<= main_~input~0 6) (and (<= 3 ~a16~0) (<= 0 ~a17~0) (= ~a21~0 1) (<= ~a17~0 1) (<= ~a16~0 6))) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and .cse4 .cse6 .cse1 .cse2) (not (= ~e~0 5)) (and .cse0 .cse7 .cse1) (not (= ~d~0 4)) (and (= 1 ~a7~0) .cse7 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse8) (not (= 21 ~u~0)) (and .cse3 .cse7 .cse4) (not (= 22 ~v~0)) (and .cse3 .cse5 .cse6) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (and .cse7 .cse4 .cse6 .cse1) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))))) [2018-11-07 18:43:03,128 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 18:43:03,128 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 18:43:03,128 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 18:43:03,128 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse6 (= 1 ~a17~0))) (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse1 (not (= ~a8~0 13))) (.cse3 (not (= ~a16~0 6))) (.cse7 (<= ~a21~0 0)) (.cse4 (or (not (= ~a7~0 ~a17~0)) (not .cse6))) (.cse5 (= 1 ~a20~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= ~a16~0 4) .cse2) (and .cse3 .cse4 .cse1 .cse2) (and (= 1 ~a7~0) .cse5 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse6) (not (= 3 ~c~0)) (and .cse5 .cse3 .cse4 .cse1) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (and .cse7 .cse3 .cse2) (not (= 2 ~b~0)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (and .cse0 .cse5 .cse1) (and .cse7 .cse5 .cse3) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 (= |old(~a20~0)| ~a20~0) .cse4) (not (= ~z~0 26)) (and .cse5 (and (<= 3 ~a16~0) (<= 0 ~a17~0) (= ~a21~0 1) (<= ~a17~0 1) (= ~a7~0 0) (<= ~a16~0 6))) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0))))) [2018-11-07 18:43:03,129 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 18:43:03,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:43:03 BoogieIcfgContainer [2018-11-07 18:43:03,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:43:03,145 INFO L168 Benchmark]: Toolchain (without parser) took 142751.11 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -131.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-07 18:43:03,146 INFO L168 Benchmark]: CDTParser took 0.20 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-07 18:43:03,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:43:03,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:43:03,148 INFO L168 Benchmark]: Boogie Preprocessor took 211.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:43:03,149 INFO L168 Benchmark]: RCFGBuilder took 3381.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2018-11-07 18:43:03,149 INFO L168 Benchmark]: TraceAbstraction took 138301.66 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 558.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 18:43:03,154 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.20 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 809.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 211.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3381.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.8 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138301.66 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 558.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(a7 == 1) && !(a8 == 13)) && a20 <= 0) || ((!(a7 == 1) && a16 == 4) && a20 <= 0)) || (((!(a16 == 6) && (!(a7 == a17) || !(1 == a17))) && !(a8 == 13)) && a20 <= 0)) || (((((1 == a7 && 1 == a20) && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || !(3 == c)) || (((1 == a20 && !(a16 == 6)) && (!(a7 == a17) || !(1 == a17))) && !(a8 == 13))) || !(1 == \old(a21))) || !(4 == d)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || !(2 == b)) || !(y == 25)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || ((!(a7 == 1) && 1 == a20) && !(a8 == 13))) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || !(21 == u)) || !(22 == v)) || ((a21 <= 0 && \old(a20) == a20) && (!(a7 == a17) || !(1 == a17)))) || !(z == 26)) || (1 == a20 && ((((3 <= a16 && 0 <= a17) && a21 == 1) && a17 <= 1) && a7 == 0) && a16 <= 6)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 138.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 91.6s AutomataDifference, 0.0s DeadEndRemovalTime, 12.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1931 SDtfs, 10494 SDslu, 2764 SDs, 0 SdLazy, 16100 SolverSat, 2263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.1s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2708 GetRequests, 2447 SyntacticMatches, 16 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5354occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 14.3s AbstIntTime, 9 AbstIntIterations, 7 AbstIntStrong, 0.9973670424569002 AbsIntWeakeningRatio, 0.19415584415584416 AbsIntAvgWeakeningVarsNumRemoved, 26.26233766233766 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 732 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 364 PreInvPairs, 710 NumberOfFragments, 1713 HoareAnnotationTreeSize, 364 FomulaSimplifications, 63815 FormulaSimplificationTreeSizeReduction, 3.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 34170 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 3252 NumberOfCodeBlocks, 3252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3721 ConstructedInterpolants, 0 QuantifiedInterpolants, 2114769 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1257 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 2040/2354 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...