java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:53:48,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:53:48,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:53:48,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:53:48,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:53:48,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:53:48,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:53:48,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:53:48,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:53:48,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:53:48,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:53:48,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:53:48,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:53:48,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:53:48,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:53:48,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:53:48,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:53:48,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:53:48,103 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:53:48,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:53:48,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:53:48,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:53:48,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:53:48,113 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:53:48,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:53:48,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:53:48,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:53:48,119 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:53:48,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:53:48,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:53:48,121 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:53:48,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:53:48,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:53:48,123 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:53:48,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:53:48,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:53:48,126 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:53:48,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:53:48,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:53:48,155 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:53:48,156 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:53:48,156 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:53:48,157 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:53:48,157 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:53:48,157 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:53:48,157 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:53:48,157 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:53:48,158 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:53:48,158 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:53:48,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:53:48,159 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:53:48,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:53:48,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:53:48,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:53:48,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:53:48,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:53:48,160 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:53:48,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:53:48,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:53:48,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:53:48,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:53:48,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:53:48,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:53:48,163 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:53:48,163 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:53:48,163 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:53:48,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:53:48,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:53:48,164 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:53:48,164 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:53:48,164 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:53:48,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:53:48,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:53:48,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:53:48,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:53:48,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:53:48,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-11-07 12:53:48,301 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3dc2611/8d35e1ca196743a08f612e3a29a5230d/FLAG208816891 [2018-11-07 12:53:48,838 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:53:48,839 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-11-07 12:53:48,854 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3dc2611/8d35e1ca196743a08f612e3a29a5230d/FLAG208816891 [2018-11-07 12:53:48,869 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3dc2611/8d35e1ca196743a08f612e3a29a5230d [2018-11-07 12:53:48,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:53:48,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:53:48,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:48,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:53:48,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:53:48,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:48" (1/1) ... [2018-11-07 12:53:48,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edc0f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:48, skipping insertion in model container [2018-11-07 12:53:48,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:53:48" (1/1) ... [2018-11-07 12:53:48,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:53:48,976 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:53:49,490 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:49,495 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:53:49,611 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:53:49,636 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:53:49,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49 WrapperNode [2018-11-07 12:53:49,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:53:49,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:49,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:53:49,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:53:49,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:53:49,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:53:49,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:53:49,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:53:49,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (1/1) ... [2018-11-07 12:53:49,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:53:49,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:53:49,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:53:49,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:53:49,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (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 12:53:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:53:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:53:49,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:53:49,947 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:53:49,947 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:53:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:53:49,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:53:49,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:53:49,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:53:53,104 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:53:53,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:53 BoogieIcfgContainer [2018-11-07 12:53:53,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:53:53,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:53:53,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:53:53,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:53:53,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:53:48" (1/3) ... [2018-11-07 12:53:53,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d677ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:53, skipping insertion in model container [2018-11-07 12:53:53,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:53:49" (2/3) ... [2018-11-07 12:53:53,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d677ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:53:53, skipping insertion in model container [2018-11-07 12:53:53,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:53:53" (3/3) ... [2018-11-07 12:53:53,129 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label20_true-unreach-call_false-termination.c [2018-11-07 12:53:53,140 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:53:53,151 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:53:53,172 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:53:53,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:53:53,224 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:53:53,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:53:53,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:53:53,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:53:53,225 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:53:53,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:53:53,225 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:53:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 12:53:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-07 12:53:53,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:53,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:53,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:53,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 915772480, now seen corresponding path program 1 times [2018-11-07 12:53:53,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:53,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:53,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:53,983 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:53:54,119 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 12:53:54,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:54,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:53:54,125 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:54,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:53:54,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:53:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:53:54,152 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 12:53:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:55,814 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-07 12:53:55,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:53:55,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-11-07 12:53:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:55,835 INFO L225 Difference]: With dead ends: 618 [2018-11-07 12:53:55,836 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 12:53:55,843 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 12:53:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 12:53:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 12:53:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 12:53:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-07 12:53:55,932 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 106 [2018-11-07 12:53:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:55,933 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-07 12:53:55,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:53:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-07 12:53:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-07 12:53:55,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:55,942 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:55,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:55,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1354213973, now seen corresponding path program 1 times [2018-11-07 12:53:55,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:55,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:55,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:55,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:55,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:56,275 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 12:53:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:56,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:56,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:53:56,339 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:56,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:53:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:53:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:53:56,342 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-07 12:53:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:58,244 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-11-07 12:53:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 12:53:58,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2018-11-07 12:53:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:58,256 INFO L225 Difference]: With dead ends: 1229 [2018-11-07 12:53:58,256 INFO L226 Difference]: Without dead ends: 856 [2018-11-07 12:53:58,263 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 12:53:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-07 12:53:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-11-07 12:53:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-11-07 12:53:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-11-07 12:53:58,331 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 122 [2018-11-07 12:53:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:58,332 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-11-07 12:53:58,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:53:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-11-07 12:53:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 12:53:58,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:58,339 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:53:58,340 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:58,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -796384502, now seen corresponding path program 1 times [2018-11-07 12:53:58,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:58,342 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:53:58,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:53:58,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 12:53:58,535 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:58,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:53:58,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:53:58,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 12:53:58,537 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-11-07 12:54:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:05,320 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-11-07 12:54:05,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:54:05,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-11-07 12:54:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:05,342 INFO L225 Difference]: With dead ends: 2557 [2018-11-07 12:54:05,342 INFO L226 Difference]: Without dead ends: 1740 [2018-11-07 12:54:05,348 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 12:54:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-11-07 12:54:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-11-07 12:54:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-11-07 12:54:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-11-07 12:54:05,443 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 129 [2018-11-07 12:54:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:05,446 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-11-07 12:54:05,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:54:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-11-07 12:54:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-07 12:54:05,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:05,457 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:05,457 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:05,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 80807714, now seen corresponding path program 1 times [2018-11-07 12:54:05,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:05,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:05,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:05,725 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:54:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 12:54:06,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:06,124 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:06,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-11-07 12:54:06,129 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:06,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:06,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:06,898 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:06,900 INFO L272 AbstractInterpreter]: Visited 107 different actions 107 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 12:54:06,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:06,945 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:07,503 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 81.02% of their original sizes. [2018-11-07 12:54:07,503 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:08,708 INFO L415 sIntCurrentIteration]: We unified 130 AI predicates to 130 [2018-11-07 12:54:08,708 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:08,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:08,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-07 12:54:08,710 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:08,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 12:54:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 12:54:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:54:08,712 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 14 states. [2018-11-07 12:54:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:27,665 INFO L93 Difference]: Finished difference Result 3656 states and 5500 transitions. [2018-11-07 12:54:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 12:54:27,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-11-07 12:54:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:27,681 INFO L225 Difference]: With dead ends: 3656 [2018-11-07 12:54:27,682 INFO L226 Difference]: Without dead ends: 1980 [2018-11-07 12:54:27,688 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-11-07 12:54:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2018-11-07 12:54:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1827. [2018-11-07 12:54:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-11-07 12:54:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-11-07 12:54:27,744 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 131 [2018-11-07 12:54:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:27,744 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-11-07 12:54:27,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 12:54:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-11-07 12:54:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-07 12:54:27,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:27,750 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:27,751 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:27,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:27,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2031058527, now seen corresponding path program 1 times [2018-11-07 12:54:27,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:27,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:27,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 12:54:27,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:27,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:27,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-11-07 12:54:27,950 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:27,956 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:27,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:28,470 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:28,470 INFO L272 AbstractInterpreter]: Visited 111 different actions 332 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 12:54:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:28,480 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:28,858 INFO L227 lantSequenceWeakener]: Weakened 138 states. On average, predicates are now at 80.76% of their original sizes. [2018-11-07 12:54:28,859 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:29,316 INFO L415 sIntCurrentIteration]: We unified 140 AI predicates to 140 [2018-11-07 12:54:29,316 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:29,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:29,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-11-07 12:54:29,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:29,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:54:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:54:29,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:54:29,318 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 10 states. [2018-11-07 12:54:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:38,055 INFO L93 Difference]: Finished difference Result 4463 states and 6600 transitions. [2018-11-07 12:54:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 12:54:38,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2018-11-07 12:54:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:38,069 INFO L225 Difference]: With dead ends: 4463 [2018-11-07 12:54:38,069 INFO L226 Difference]: Without dead ends: 2642 [2018-11-07 12:54:38,077 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:54:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2018-11-07 12:54:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2556. [2018-11-07 12:54:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2018-11-07 12:54:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3571 transitions. [2018-11-07 12:54:38,145 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3571 transitions. Word has length 141 [2018-11-07 12:54:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:38,145 INFO L480 AbstractCegarLoop]: Abstraction has 2556 states and 3571 transitions. [2018-11-07 12:54:38,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:54:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3571 transitions. [2018-11-07 12:54:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 12:54:38,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:38,153 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:54:38,153 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:38,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1483859631, now seen corresponding path program 1 times [2018-11-07 12:54:38,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:38,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:38,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:38,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:54:38,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:38,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:38,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-07 12:54:38,612 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:38,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:38,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:39,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:54:39,394 INFO L272 AbstractInterpreter]: Visited 111 different actions 329 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:39,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:39,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:54:39,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:39,424 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 12:54:39,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:39,440 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:54:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:39,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:54:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:39,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:54:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 12:54:40,001 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:40,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-07 12:54:40,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:40,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:54:40,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:54:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:54:40,003 INFO L87 Difference]: Start difference. First operand 2556 states and 3571 transitions. Second operand 3 states. [2018-11-07 12:54:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:41,986 INFO L93 Difference]: Finished difference Result 7161 states and 10364 transitions. [2018-11-07 12:54:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:54:41,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-07 12:54:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:42,013 INFO L225 Difference]: With dead ends: 7161 [2018-11-07 12:54:42,013 INFO L226 Difference]: Without dead ends: 3930 [2018-11-07 12:54:42,031 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:54:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-11-07 12:54:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3914. [2018-11-07 12:54:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3914 states. [2018-11-07 12:54:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 5229 transitions. [2018-11-07 12:54:42,147 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 5229 transitions. Word has length 143 [2018-11-07 12:54:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:42,148 INFO L480 AbstractCegarLoop]: Abstraction has 3914 states and 5229 transitions. [2018-11-07 12:54:42,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:54:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 5229 transitions. [2018-11-07 12:54:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 12:54:42,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:42,160 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:42,161 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:42,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -793512577, now seen corresponding path program 1 times [2018-11-07 12:54:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:42,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:42,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:42,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:42,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:42,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:42,624 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-07 12:54:42,624 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:42,630 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:42,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:43,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:54:43,639 INFO L272 AbstractInterpreter]: Visited 111 different actions 329 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 12:54:43,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:43,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:54:43,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:43,666 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 12:54:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:43,685 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:54:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:43,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:54:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:43,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:54:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:54:44,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:54:44,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-07 12:54:44,453 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:54:44,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 12:54:44,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 12:54:44,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 12:54:44,455 INFO L87 Difference]: Start difference. First operand 3914 states and 5229 transitions. Second operand 6 states. [2018-11-07 12:54:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:47,580 INFO L93 Difference]: Finished difference Result 9295 states and 12492 transitions. [2018-11-07 12:54:47,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 12:54:47,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-11-07 12:54:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:54:47,612 INFO L225 Difference]: With dead ends: 9295 [2018-11-07 12:54:47,612 INFO L226 Difference]: Without dead ends: 5387 [2018-11-07 12:54:47,629 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:54:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-07 12:54:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5220. [2018-11-07 12:54:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2018-11-07 12:54:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6764 transitions. [2018-11-07 12:54:47,771 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6764 transitions. Word has length 156 [2018-11-07 12:54:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:54:47,772 INFO L480 AbstractCegarLoop]: Abstraction has 5220 states and 6764 transitions. [2018-11-07 12:54:47,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 12:54:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6764 transitions. [2018-11-07 12:54:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 12:54:47,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:54:47,790 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:47,790 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:54:47,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1725689910, now seen corresponding path program 1 times [2018-11-07 12:54:47,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:54:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:47,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:54:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:54:47,792 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:54:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:54:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 98 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 12:54:48,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:54:48,220 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:54:48,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-11-07 12:54:48,222 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:54:48,229 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:54:48,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:54:48,601 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:54:48,601 INFO L272 AbstractInterpreter]: Visited 111 different actions 218 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 12:54:48,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:54:48,634 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:54:49,082 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 80.71% of their original sizes. [2018-11-07 12:54:49,082 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:54:49,785 INFO L415 sIntCurrentIteration]: We unified 199 AI predicates to 199 [2018-11-07 12:54:49,786 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:54:49,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:54:49,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-11-07 12:54:49,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:54:49,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 12:54:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 12:54:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:54:49,789 INFO L87 Difference]: Start difference. First operand 5220 states and 6764 transitions. Second operand 18 states. [2018-11-07 12:54:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:54:59,996 INFO L93 Difference]: Finished difference Result 10163 states and 12950 transitions. [2018-11-07 12:54:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:54:59,997 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2018-11-07 12:54:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:00,025 INFO L225 Difference]: With dead ends: 10163 [2018-11-07 12:55:00,025 INFO L226 Difference]: Without dead ends: 5989 [2018-11-07 12:55:00,039 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 12:55:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2018-11-07 12:55:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5969. [2018-11-07 12:55:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5969 states. [2018-11-07 12:55:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5969 states to 5969 states and 7570 transitions. [2018-11-07 12:55:00,217 INFO L78 Accepts]: Start accepts. Automaton has 5969 states and 7570 transitions. Word has length 200 [2018-11-07 12:55:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:00,218 INFO L480 AbstractCegarLoop]: Abstraction has 5969 states and 7570 transitions. [2018-11-07 12:55:00,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 12:55:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5969 states and 7570 transitions. [2018-11-07 12:55:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-07 12:55:00,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:00,240 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:00,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:00,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:00,241 INFO L82 PathProgramCache]: Analyzing trace with hash 938174553, now seen corresponding path program 1 times [2018-11-07 12:55:00,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:00,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:00,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:00,505 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:55:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 150 proven. 60 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 12:55:01,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:01,257 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:01,257 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-11-07 12:55:01,258 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [67], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:01,263 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:01,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:02,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:02,963 INFO L272 AbstractInterpreter]: Visited 115 different actions 920 times. Merged at 9 different actions 85 times. Widened at 1 different actions 5 times. Found 20 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 12:55:02,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:02,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:02,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:02,974 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 12:55:02,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:02,983 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:03,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 12:55:03,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 162 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-07 12:55:03,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:03,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-11-07 12:55:03,370 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:03,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:55:03,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:55:03,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:55:03,371 INFO L87 Difference]: Start difference. First operand 5969 states and 7570 transitions. Second operand 11 states. [2018-11-07 12:55:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:05,133 INFO L93 Difference]: Finished difference Result 13079 states and 16689 transitions. [2018-11-07 12:55:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:55:05,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2018-11-07 12:55:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:05,177 INFO L225 Difference]: With dead ends: 13079 [2018-11-07 12:55:05,177 INFO L226 Difference]: Without dead ends: 6970 [2018-11-07 12:55:05,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 474 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:55:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2018-11-07 12:55:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6838. [2018-11-07 12:55:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6838 states. [2018-11-07 12:55:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6838 states to 6838 states and 8095 transitions. [2018-11-07 12:55:05,375 INFO L78 Accepts]: Start accepts. Automaton has 6838 states and 8095 transitions. Word has length 236 [2018-11-07 12:55:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:05,375 INFO L480 AbstractCegarLoop]: Abstraction has 6838 states and 8095 transitions. [2018-11-07 12:55:05,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:55:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6838 states and 8095 transitions. [2018-11-07 12:55:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-07 12:55:05,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:55:05,395 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:05,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:55:05,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1488399591, now seen corresponding path program 1 times [2018-11-07 12:55:05,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:55:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:05,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:55:05,397 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:55:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:05,672 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 12:55:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 165 proven. 84 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 12:55:05,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:05,794 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:55:05,794 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-11-07 12:55:05,794 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [190], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [519], [521], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 12:55:05,797 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:55:05,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:55:06,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:55:06,449 INFO L272 AbstractInterpreter]: Visited 113 different actions 451 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 12:55:06,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:55:06,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:55:06,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:55:06,453 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:55:06,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:55:06,463 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:55:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:55:06,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:55:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 202 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 12:55:06,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:55:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 180 proven. 49 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-07 12:55:07,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:55:07,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-11-07 12:55:07,234 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:55:07,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 12:55:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 12:55:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-07 12:55:07,236 INFO L87 Difference]: Start difference. First operand 6838 states and 8095 transitions. Second operand 15 states. [2018-11-07 12:55:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:55:10,158 INFO L93 Difference]: Finished difference Result 13528 states and 16310 transitions. [2018-11-07 12:55:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 12:55:10,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 252 [2018-11-07 12:55:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:55:10,170 INFO L225 Difference]: With dead ends: 13528 [2018-11-07 12:55:10,170 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:55:10,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 514 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:55:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:55:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:55:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:55:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:55:10,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2018-11-07 12:55:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:55:10,202 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:55:10,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 12:55:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:55:10,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:55:10,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:55:10,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,734 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 161 [2018-11-07 12:55:10,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:10,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:11,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:11,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:11,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:55:11,062 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 187 [2018-11-07 12:55:12,066 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-11-07 12:55:12,865 WARN L179 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2018-11-07 12:55:14,627 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 292 DAG size of output: 69 [2018-11-07 12:55:15,758 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 189 DAG size of output: 97 [2018-11-07 12:55:16,425 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 94 [2018-11-07 12:55:16,429 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:55:16,429 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 12:55:16,429 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:55:16,429 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,429 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 12:55:16,430 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 12:55:16,431 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 12:55:16,432 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 12:55:16,433 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,434 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 12:55:16,435 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 12:55:16,436 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 12:55:16,437 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 12:55:16,438 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 12:55:16,439 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,440 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,441 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 12:55:16,442 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,443 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 12:55:16,444 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,445 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 12:55:16,446 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,447 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse13 (= 1 |old(~a25~0)|)) (.cse4 (= ~a11~0 |old(~a11~0)|)) (.cse16 (= |old(~a28~0)| ~a28~0)) (.cse9 (= |old(~a19~0)| ~a19~0)) (.cse10 (= ~a17~0 |old(~a17~0)|)) (.cse11 (= ~a25~0 |old(~a25~0)|))) (let ((.cse3 (= |old(~a11~0)| |old(~a19~0)|)) (.cse1 (and .cse4 .cse16 .cse9 .cse10 .cse11)) (.cse5 (<= 10 ~a28~0)) (.cse6 (<= ~a28~0 10)) (.cse8 (< |old(~a28~0)| 10)) (.cse0 (not .cse13)) (.cse12 (= 7 ~a17~0)) (.cse14 (not (= 7 |old(~a17~0)|))) (.cse7 (< 10 |old(~a28~0)|)) (.cse15 (= 10 |old(~a28~0)|)) (.cse2 (not (= |old(~a17~0)| 8)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< 6 |calculate_output_#in~input|) (not (= 1 ~a21~0)) (and .cse4 .cse5 .cse6 (= |old(~a25~0)| ~a25~0) (= ~a17~0 8) (= ~a19~0 1)) (< |old(~a25~0)| 0) .cse7 (not (= 1 |old(~a19~0)|)) (< 1 |old(~a25~0)|) .cse8 (not (= 8 |old(~a17~0)|)) (< |calculate_output_#in~input| 1)) (or .cse7 .cse0 (and .cse9 .cse4 .cse5 .cse10 .cse6 .cse11) .cse8 .cse2) (or .cse7 .cse2 .cse3 .cse1) (or .cse7 (and .cse9 .cse4 .cse5 .cse12 .cse6 .cse11) .cse8 .cse13 .cse14) (or .cse7 .cse0 .cse15 (and .cse16 .cse9 .cse4 .cse12 .cse11) .cse14) (or .cse7 .cse15 .cse2 (and .cse16 .cse9 .cse4 .cse10 .cse11))))) [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 12:55:16,448 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 12:55:16,449 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 12:55:16,450 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 12:55:16,451 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 12:55:16,452 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 12:55:16,453 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 12:55:16,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:55:16,454 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 12:55:16,454 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:55:16,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:55:16,454 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:55:16,454 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 12:55:16,455 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse2 (not (= ~a19~0 ~a11~0))) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse4 (= 7 ~a17~0)) (.cse5 (= 1 ~a25~0)) (.cse1 (<= ~a28~0 10)) (.cse3 (not (= ~a28~0 10)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse4 .cse1) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse5 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse5 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and (<= 0 ~a25~0) .cse1 (= ~a17~0 8) (= ~a19~0 1) (<= ~a25~0 1)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse4 .cse5 .cse1 .cse3) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 12:55:16,455 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:55:16,455 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 12:55:16,455 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse2 (not (= ~a19~0 ~a11~0))) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse4 (= 7 ~a17~0)) (.cse5 (= 1 ~a25~0)) (.cse1 (<= ~a28~0 10)) (.cse3 (not (= ~a28~0 10)))) (or (and .cse0 .cse1 .cse2) (and (<= 1 main_~input~0) (<= main_~input~0 6) .cse1 (<= ~a25~0 1) (<= 0 ~a25~0) (= ~a17~0 8) (= ~a19~0 1)) (and .cse0 .cse1 .cse3) (and (<= 10 ~a28~0) (not (= ~a25~0 1)) .cse4 .cse1) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse5 .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse0 .cse5 .cse1) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (and .cse4 .cse5 .cse1 .cse3) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 12:55:16,455 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 12:55:16,456 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 12:55:16,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:55:16 BoogieIcfgContainer [2018-11-07 12:55:16,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:55:16,479 INFO L168 Benchmark]: Toolchain (without parser) took 87592.89 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-07 12:55:16,480 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:55:16,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:16,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:16,482 INFO L168 Benchmark]: Boogie Preprocessor took 124.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:16,484 INFO L168 Benchmark]: RCFGBuilder took 3215.05 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: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:55:16,485 INFO L168 Benchmark]: TraceAbstraction took 83371.47 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -668.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 12:55:16,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 126.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3215.05 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: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83371.47 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -668.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\old(a17) == a17 && a28 <= 10) && !(a19 == a11)) || ((\old(a17) == a17 && a28 <= 10) && !(a28 == 10))) || (((10 <= a28 && !(a25 == 1)) && 7 == a17) && a28 <= 10)) || !(a21 == 1)) || !(y == 25)) || ((\old(a17) == a17 && 1 == a25) && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || ((\old(a17) == a17 && 1 == a25) && a28 <= 10)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || ((((0 <= a25 && a28 <= 10) && a17 == 8) && a19 == 1) && a25 <= 1)) || !(z == 26)) || !(0 == \old(a25))) || (((7 == a17 && 1 == a25) && a28 <= 10) && !(a28 == 10))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 83.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 58.4s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1815 SDtfs, 11727 SDslu, 2689 SDs, 0 SdLazy, 12939 SolverSat, 2265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2189 GetRequests, 2028 SyntacticMatches, 14 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6838occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.9s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.99678000284422 AbsIntWeakeningRatio, 0.24733475479744135 AbsIntAvgWeakeningVarsNumRemoved, 24.916844349680172 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 665 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 204 PreInvPairs, 296 NumberOfFragments, 716 HoareAnnotationTreeSize, 204 FomulaSimplifications, 8498 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9437 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2403 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210267 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2007 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 1787/2070 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...