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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:05:00,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:05:00,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:05:00,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:05:00,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:05:00,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:05:00,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:05:00,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:05:00,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:05:00,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:05:00,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:05:00,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:05:00,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:05:00,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:05:00,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:05:00,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:05:00,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:05:00,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:05:00,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:05:00,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:05:00,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:05:00,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:05:00,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:05:00,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:05:00,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:05:00,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:05:00,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:05:00,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:05:00,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:05:00,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:05:00,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:05:00,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:05:00,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:05:00,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:05:00,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:05:00,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:05:00,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:05:00,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:05:00,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:05:00,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:05:00,821 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:05:00,822 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:05:00,822 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:05:00,822 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:05:00,822 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:05:00,822 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:05:00,823 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:05:00,823 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:05:00,823 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:05:00,823 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:05:00,823 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:05:00,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:05:00,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:05:00,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:05:00,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:05:00,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:05:00,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:05:00,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:05:00,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:05:00,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:05:00,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:05:00,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:05:00,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:05:00,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:05:00,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:05:00,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:05:00,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:05:00,827 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:05:00,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:05:00,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:05:00,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:05:00,828 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:05:00,828 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:05:00,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:05:00,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:05:00,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:05:00,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:05:00,897 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:05:00,897 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 07:05:00,963 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc29e0529/d2dd48b17c084028b29ef9040051982c/FLAGead8dfc41 [2018-11-07 07:05:01,586 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:05:01,587 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 07:05:01,613 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc29e0529/d2dd48b17c084028b29ef9040051982c/FLAGead8dfc41 [2018-11-07 07:05:01,632 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc29e0529/d2dd48b17c084028b29ef9040051982c [2018-11-07 07:05:01,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:05:01,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:05:01,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:05:01,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:05:01,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:05:01,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:05:01" (1/1) ... [2018-11-07 07:05:01,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b5474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:01, skipping insertion in model container [2018-11-07 07:05:01,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:05:01" (1/1) ... [2018-11-07 07:05:01,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:05:01,724 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:05:02,252 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:05:02,257 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:05:02,396 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:05:02,415 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:05:02,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02 WrapperNode [2018-11-07 07:05:02,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:05:02,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:05:02,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:05:02,417 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:05:02,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:05:02,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:05:02,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:05:02,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:05:02,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (1/1) ... [2018-11-07 07:05:02,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:05:02,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:05:02,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:05:02,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:05:02,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (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 07:05:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:05:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:05:02,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:05:02,754 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:05:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:05:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:05:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:05:02,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:05:02,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:05:06,119 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:05:06,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:05:06 BoogieIcfgContainer [2018-11-07 07:05:06,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:05:06,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:05:06,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:05:06,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:05:06,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:05:01" (1/3) ... [2018-11-07 07:05:06,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c11ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:05:06, skipping insertion in model container [2018-11-07 07:05:06,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:02" (2/3) ... [2018-11-07 07:05:06,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c11ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:05:06, skipping insertion in model container [2018-11-07 07:05:06,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:05:06" (3/3) ... [2018-11-07 07:05:06,129 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23_true-unreach-call_false-termination.c [2018-11-07 07:05:06,139 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:05:06,149 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:05:06,167 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:05:06,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:05:06,208 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:05:06,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:05:06,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:05:06,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:05:06,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:05:06,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:05:06,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:05:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 07:05:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-07 07:05:06,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:06,253 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] [2018-11-07 07:05:06,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:06,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1921053824, now seen corresponding path program 1 times [2018-11-07 07:05:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:06,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:06,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:06,917 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:05:07,078 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 07:05:07,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:07,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:07,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:07,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:07,110 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 07:05:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:08,687 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 07:05:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:08,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-07 07:05:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:08,709 INFO L225 Difference]: With dead ends: 550 [2018-11-07 07:05:08,710 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 07:05:08,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 07:05:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 07:05:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 07:05:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 07:05:08,815 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 102 [2018-11-07 07:05:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:08,816 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 07:05:08,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 07:05:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 07:05:08,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:08,824 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] [2018-11-07 07:05:08,824 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:08,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1248804383, now seen corresponding path program 1 times [2018-11-07 07:05:08,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:08,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:08,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:08,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:09,023 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 07:05:09,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:09,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:05:09,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:09,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:05:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:05:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:05:09,027 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 07:05:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:10,899 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 07:05:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:05:10,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-07 07:05:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:10,907 INFO L225 Difference]: With dead ends: 888 [2018-11-07 07:05:10,908 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 07:05:10,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 07:05:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 07:05:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 07:05:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 07:05:10,956 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 113 [2018-11-07 07:05:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:10,956 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 07:05:10,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:05:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 07:05:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-07 07:05:10,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:10,961 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] [2018-11-07 07:05:10,962 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:10,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2079561357, now seen corresponding path program 1 times [2018-11-07 07:05:10,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:10,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:10,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:10,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:10,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:11,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:11,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:11,237 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2018-11-07 07:05:11,239 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:11,292 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:11,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:12,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:05:12,222 INFO L272 AbstractInterpreter]: Visited 106 different actions 204 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:05:12,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:12,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:05:12,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:12,241 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 07:05:12,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:12,263 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:05:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:12,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:05:12,573 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 07:05:12,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:05:12,698 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 07:05:12,720 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:12,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-11-07 07:05:12,720 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:12,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:12,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:12,722 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-07 07:05:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:14,244 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-11-07 07:05:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:14,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-07 07:05:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:14,252 INFO L225 Difference]: With dead ends: 1530 [2018-11-07 07:05:14,252 INFO L226 Difference]: Without dead ends: 997 [2018-11-07 07:05:14,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-07 07:05:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-07 07:05:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-07 07:05:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-11-07 07:05:14,298 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 114 [2018-11-07 07:05:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:14,299 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-11-07 07:05:14,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-11-07 07:05:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 07:05:14,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:14,304 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 07:05:14,304 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:14,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 896515303, now seen corresponding path program 1 times [2018-11-07 07:05:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:14,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:14,579 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:05:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:14,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:14,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:14,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:14,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:14,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:14,664 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-11-07 07:05:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:16,632 INFO L93 Difference]: Finished difference Result 2438 states and 3658 transitions. [2018-11-07 07:05:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:16,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-11-07 07:05:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:16,645 INFO L225 Difference]: With dead ends: 2438 [2018-11-07 07:05:16,646 INFO L226 Difference]: Without dead ends: 1447 [2018-11-07 07:05:16,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2018-11-07 07:05:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2018-11-07 07:05:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1447 states. [2018-11-07 07:05:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2086 transitions. [2018-11-07 07:05:16,710 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2086 transitions. Word has length 120 [2018-11-07 07:05:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:16,711 INFO L480 AbstractCegarLoop]: Abstraction has 1447 states and 2086 transitions. [2018-11-07 07:05:16,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2086 transitions. [2018-11-07 07:05:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 07:05:16,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:16,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:16,720 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:16,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1267173673, now seen corresponding path program 1 times [2018-11-07 07:05:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:16,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:16,724 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:16,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:16,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:05:16,948 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:16,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:05:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:05:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:05:16,950 INFO L87 Difference]: Start difference. First operand 1447 states and 2086 transitions. Second operand 6 states. [2018-11-07 07:05:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:18,628 INFO L93 Difference]: Finished difference Result 3031 states and 4481 transitions. [2018-11-07 07:05:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:05:18,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-07 07:05:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:18,642 INFO L225 Difference]: With dead ends: 3031 [2018-11-07 07:05:18,643 INFO L226 Difference]: Without dead ends: 1590 [2018-11-07 07:05:18,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-11-07 07:05:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1540. [2018-11-07 07:05:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-11-07 07:05:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1980 transitions. [2018-11-07 07:05:18,710 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1980 transitions. Word has length 128 [2018-11-07 07:05:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:18,712 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 1980 transitions. [2018-11-07 07:05:18,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:05:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1980 transitions. [2018-11-07 07:05:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 07:05:18,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:18,717 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:18,717 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:18,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1675141633, now seen corresponding path program 1 times [2018-11-07 07:05:18,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:18,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:18,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:18,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:18,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:18,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:18,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:18,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:18,908 INFO L87 Difference]: Start difference. First operand 1540 states and 1980 transitions. Second operand 3 states. [2018-11-07 07:05:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:19,707 INFO L93 Difference]: Finished difference Result 4456 states and 5895 transitions. [2018-11-07 07:05:19,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:19,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-11-07 07:05:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:19,737 INFO L225 Difference]: With dead ends: 4456 [2018-11-07 07:05:19,737 INFO L226 Difference]: Without dead ends: 2922 [2018-11-07 07:05:19,745 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 07:05:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2018-11-07 07:05:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2914. [2018-11-07 07:05:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2018-11-07 07:05:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3698 transitions. [2018-11-07 07:05:19,832 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3698 transitions. Word has length 129 [2018-11-07 07:05:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:19,833 INFO L480 AbstractCegarLoop]: Abstraction has 2914 states and 3698 transitions. [2018-11-07 07:05:19,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3698 transitions. [2018-11-07 07:05:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-07 07:05:19,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:19,845 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, 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] [2018-11-07 07:05:19,845 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:19,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 208675339, now seen corresponding path program 1 times [2018-11-07 07:05:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:19,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:19,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:20,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:20,175 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:20,175 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-11-07 07:05:20,176 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:20,184 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:20,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:20,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:05:20,557 INFO L272 AbstractInterpreter]: Visited 105 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 07:05:20,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:20,585 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:05:21,001 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 81.63% of their original sizes. [2018-11-07 07:05:21,001 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:05:21,344 INFO L415 sIntCurrentIteration]: We unified 165 AI predicates to 165 [2018-11-07 07:05:21,344 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:05:21,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:21,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-11-07 07:05:21,345 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:21,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:05:21,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:05:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:05:21,346 INFO L87 Difference]: Start difference. First operand 2914 states and 3698 transitions. Second operand 10 states. [2018-11-07 07:05:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:35,932 INFO L93 Difference]: Finished difference Result 6373 states and 8229 transitions. [2018-11-07 07:05:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:05:35,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2018-11-07 07:05:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:36,112 INFO L225 Difference]: With dead ends: 6373 [2018-11-07 07:05:36,112 INFO L226 Difference]: Without dead ends: 3465 [2018-11-07 07:05:36,121 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:05:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2018-11-07 07:05:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3326. [2018-11-07 07:05:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2018-11-07 07:05:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4153 transitions. [2018-11-07 07:05:36,203 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4153 transitions. Word has length 166 [2018-11-07 07:05:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:36,204 INFO L480 AbstractCegarLoop]: Abstraction has 3326 states and 4153 transitions. [2018-11-07 07:05:36,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:05:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4153 transitions. [2018-11-07 07:05:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-07 07:05:36,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:36,217 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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] [2018-11-07 07:05:36,217 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:36,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2117677329, now seen corresponding path program 1 times [2018-11-07 07:05:36,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:36,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:36,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 96 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 07:05:36,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:36,513 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:36,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-11-07 07:05:36,513 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:36,518 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:36,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:36,810 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:05:36,810 INFO L272 AbstractInterpreter]: Visited 107 different actions 322 times. Merged at 8 different actions 23 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:05:36,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:36,845 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:05:37,116 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 83.34% of their original sizes. [2018-11-07 07:05:37,116 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:05:37,567 INFO L415 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2018-11-07 07:05:37,567 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:05:37,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:37,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-11-07 07:05:37,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:37,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:05:37,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:05:37,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:37,569 INFO L87 Difference]: Start difference. First operand 3326 states and 4153 transitions. Second operand 9 states. [2018-11-07 07:05:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:44,643 INFO L93 Difference]: Finished difference Result 7078 states and 9081 transitions. [2018-11-07 07:05:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 07:05:44,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-11-07 07:05:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:44,659 INFO L225 Difference]: With dead ends: 7078 [2018-11-07 07:05:44,660 INFO L226 Difference]: Without dead ends: 4170 [2018-11-07 07:05:44,670 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-07 07:05:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-07 07:05:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4155. [2018-11-07 07:05:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4155 states. [2018-11-07 07:05:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5248 transitions. [2018-11-07 07:05:44,775 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5248 transitions. Word has length 195 [2018-11-07 07:05:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:44,776 INFO L480 AbstractCegarLoop]: Abstraction has 4155 states and 5248 transitions. [2018-11-07 07:05:44,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:05:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5248 transitions. [2018-11-07 07:05:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 07:05:44,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:44,792 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:44,792 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:44,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1122503782, now seen corresponding path program 1 times [2018-11-07 07:05:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:44,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 07:05:45,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:45,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:45,001 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 07:05:45,001 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:45,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:45,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:45,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:05:45,255 INFO L272 AbstractInterpreter]: Visited 109 different actions 334 times. Merged at 8 different actions 30 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:05:45,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:45,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:05:45,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:45,266 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 07:05:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:45,277 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:05:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:45,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:05:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 07:05:45,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:05:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 125 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 07:05:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:05:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 07:05:45,797 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:05:45,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:05:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:05:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:05:45,798 INFO L87 Difference]: Start difference. First operand 4155 states and 5248 transitions. Second operand 9 states. [2018-11-07 07:05:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:49,349 INFO L93 Difference]: Finished difference Result 11083 states and 14644 transitions. [2018-11-07 07:05:49,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:05:49,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2018-11-07 07:05:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:49,391 INFO L225 Difference]: With dead ends: 11083 [2018-11-07 07:05:49,392 INFO L226 Difference]: Without dead ends: 6773 [2018-11-07 07:05:49,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-07 07:05:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2018-11-07 07:05:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6705. [2018-11-07 07:05:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6705 states. [2018-11-07 07:05:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 8661 transitions. [2018-11-07 07:05:49,630 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 8661 transitions. Word has length 219 [2018-11-07 07:05:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:49,630 INFO L480 AbstractCegarLoop]: Abstraction has 6705 states and 8661 transitions. [2018-11-07 07:05:49,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:05:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 8661 transitions. [2018-11-07 07:05:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-07 07:05:49,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:49,669 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:49,670 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:49,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash 889346168, now seen corresponding path program 1 times [2018-11-07 07:05:49,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:49,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:49,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:49,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 130 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 07:05:49,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:49,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:49,993 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-07 07:05:49,993 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [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], [453], [455], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:49,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:49,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:50,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:05:50,227 INFO L272 AbstractInterpreter]: Visited 109 different actions 334 times. Merged at 8 different actions 30 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:05:50,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:50,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:05:50,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:50,236 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:05:50,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:50,246 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:05:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:50,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:05:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 07:05:50,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:05:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 07:05:50,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:05:50,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 07:05:50,856 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:05:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:05:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:05:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:05:50,857 INFO L87 Difference]: Start difference. First operand 6705 states and 8661 transitions. Second operand 9 states. [2018-11-07 07:05:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:54,081 INFO L93 Difference]: Finished difference Result 19460 states and 26358 transitions. [2018-11-07 07:05:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 07:05:54,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2018-11-07 07:05:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:54,087 INFO L225 Difference]: With dead ends: 19460 [2018-11-07 07:05:54,088 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:05:54,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2018-11-07 07:05:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:05:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:05:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:05:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:05:54,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-07 07:05:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:54,160 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:05:54,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:05:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:05:54,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:05:54,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:05:54,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:54,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,202 WARN L179 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 169 [2018-11-07 07:05:55,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:05:55,819 WARN L179 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 162 [2018-11-07 07:05:56,274 WARN L179 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-11-07 07:05:57,234 WARN L179 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2018-11-07 07:05:59,339 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 253 DAG size of output: 82 [2018-11-07 07:06:00,150 WARN L179 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 54 [2018-11-07 07:06:01,015 WARN L179 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 54 [2018-11-07 07:06:01,019 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:06:01,019 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a21~0 |old(~a21~0)|)) [2018-11-07 07:06:01,019 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:06:01,019 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,020 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,021 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 07:06:01,022 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 07:06:01,023 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 07:06:01,024 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,025 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 07:06:01,026 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,027 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 07:06:01,028 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,029 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 07:06:01,030 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,031 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 07:06:01,032 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 07:06:01,033 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 07:06:01,034 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 07:06:01,034 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 07:06:01,034 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 07:06:01,034 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 07:06:01,034 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 07:06:01,034 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse12 (= 4 |old(~a16~0)|)) (.cse11 (= 15 |old(~a8~0)|)) (.cse2 (= 1 |old(~a20~0)|)) (.cse18 (= |old(~a8~0)| ~a8~0)) (.cse19 (= |old(~a16~0)| ~a16~0))) (let ((.cse14 (= 0 |old(~a16~0)|)) (.cse9 (= ~a7~0 0)) (.cse7 (< 0 |old(~a17~0)|)) (.cse16 (and (<= ~a17~0 |old(~a17~0)|) .cse18 .cse19 (= ~a21~0 |old(~a21~0)|))) (.cse3 (not (= 0 |old(~a7~0)|))) (.cse0 (not (= 1 |old(~a21~0)|))) (.cse6 (not (= 8 ~a12~0))) (.cse8 (= |calculate_output_#in~input| 0)) (.cse15 (= ~a20~0 1)) (.cse13 (not .cse2)) (.cse4 (not .cse11)) (.cse10 (not (= |old(~a16~0)| 5))) (.cse17 (< 13 |old(~a8~0)|)) (.cse5 (not .cse12)) (.cse1 (not (= 1 ~a20~0)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse2 .cse11) (or (or .cse3 .cse0 .cse12 .cse13 .cse4) .cse14 .cse6 .cse7 .cse8 .cse15) (or (or .cse3 .cse0 (not (= 0 |old(~a17~0)|))) (and (= ~a17~0 0) .cse15) .cse5 .cse6 .cse8 .cse13 .cse4) (or .cse0 .cse16 .cse12) (or .cse17 .cse7 .cse16) (or .cse3 .cse0 .cse9 .cse12 .cse4 .cse14 .cse6 .cse8) (or .cse3 .cse0 .cse4 .cse5 .cse6 .cse8 .cse2 .cse9) (or (= 6 |old(~a16~0)|) .cse17 .cse16) (or .cse16 .cse0 .cse7) (or .cse0 .cse16 .cse11) (or .cse0 .cse2 .cse16) (or .cse3 .cse0 .cse6 .cse8 (not (= 1 |old(~a17~0)|)) (and (= ~a17~0 1) .cse15) .cse13 .cse4 (not (= 5 |old(~a16~0)|))) (or (and .cse18 .cse19) .cse10 .cse11) (or .cse17 .cse5 .cse2 .cse1)))) [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 07:06:01,035 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 07:06:01,036 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 07:06:01,037 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 461) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 07:06:01,038 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,039 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 07:06:01,040 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 07:06:01,041 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 07:06:01,041 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 07:06:01,041 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 07:06:01,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:06:01,041 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 07:06:01,041 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:06:01,041 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:06:01,041 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and (= ~a17~0 1) (= ~a7~0 0) (= |old(~a8~0)| ~a8~0) (= 1 ~a21~0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-11-07 07:06:01,042 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:06:01,042 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a8~0 13)) (.cse1 (<= ~a17~0 0)) (.cse3 (not (= ~a8~0 15))) (.cse2 (= 1 ~a21~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1) (not (= 8 ~a12~0)) (and .cse0 (not (= ~a16~0 6))) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (not (= 1 ~a20~0)) .cse2) (and (= |old(~a16~0)| ~a16~0) .cse3) (and .cse2 .cse1) (and .cse2 (not (= ~a16~0 4))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (and .cse3 .cse2) (not (= 15 |old(~a8~0)|)))) [2018-11-07 07:06:01,042 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 07:06:01,042 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 07:06:01,042 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 07:06:01,042 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a8~0 13)) (.cse1 (<= ~a17~0 0)) (.cse3 (not (= ~a8~0 15))) (.cse2 (= 1 ~a21~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1) (not (= 8 ~a12~0)) (and .cse0 (not (= ~a16~0 6))) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and (not (= 1 ~a20~0)) .cse2) (and (= |old(~a16~0)| ~a16~0) .cse3) (and .cse2 .cse1) (and .cse2 (not (= ~a16~0 4))) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (and .cse3 .cse2) (not (= 15 |old(~a8~0)|)))) [2018-11-07 07:06:01,042 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:06:01,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:06:01 BoogieIcfgContainer [2018-11-07 07:06:01,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:06:01,060 INFO L168 Benchmark]: Toolchain (without parser) took 59416.94 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -871.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-07 07:06:01,062 INFO L168 Benchmark]: CDTParser took 0.23 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 07:06:01,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.75 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 07:06:01,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:01,067 INFO L168 Benchmark]: Boogie Preprocessor took 115.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:06:01,067 INFO L168 Benchmark]: RCFGBuilder took 3442.80 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: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:01,068 INFO L168 Benchmark]: TraceAbstraction took 54938.02 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 932.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -213.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-07 07:06:01,077 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.23 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 770.75 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 144.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.80 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3442.80 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: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54938.02 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 932.2 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -213.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 461]: 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: ((((((((((((!(1 == \old(a21)) || (a8 <= 13 && a17 <= 0)) || !(8 == a12)) || (a8 <= 13 && !(a16 == 6))) || !(1 == \old(a20))) || !(5 == \old(a16))) || (!(1 == a20) && 1 == a21)) || (\old(a16) == a16 && !(a8 == 15))) || (1 == a21 && a17 <= 0)) || (1 == a21 && !(a16 == 4))) || !(0 == \old(a7))) || !(1 == \old(a17))) || (!(a8 == 15) && 1 == a21)) || !(15 == \old(a8)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 54.8s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 38.3s AutomataDifference, 0.0s DeadEndRemovalTime, 6.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1872 SDtfs, 5971 SDslu, 1969 SDs, 0 SdLazy, 10995 SolverSat, 1868 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1588 GetRequests, 1482 SyntacticMatches, 9 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6705occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 5 AbstIntIterations, 2 AbstIntStrong, 0.9976519047922453 AbsIntWeakeningRatio, 0.19498607242339833 AbsIntAvgWeakeningVarsNumRemoved, 27.972144846796656 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 295 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 350 PreInvPairs, 708 NumberOfFragments, 644 HoareAnnotationTreeSize, 350 FomulaSimplifications, 16774 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 13172 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2608 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038605 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1369/1522 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...