java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:05:32,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:05:32,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:05:32,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:05:32,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:05:32,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:05:32,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:05:32,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:05:32,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:05:32,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:05:32,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:05:32,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:05:32,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:05:32,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:05:32,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:05:32,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:05:32,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:05:32,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:05:32,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:05:32,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:05:32,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:05:32,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:05:32,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:05:32,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:05:32,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:05:32,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:05:32,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:05:32,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:05:32,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:05:32,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:05:32,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:05:32,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:05:32,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:05:32,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:05:32,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:05:32,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:05:32,165 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:05:32,190 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:05:32,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:05:32,193 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:05:32,194 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:05:32,194 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:05:32,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:05:32,194 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:05:32,194 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:05:32,195 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:05:32,195 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:05:32,195 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:05:32,195 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:05:32,195 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:05:32,195 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:05:32,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:05:32,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:05:32,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:05:32,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:05:32,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:05:32,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:05:32,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:05:32,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:05:32,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:05:32,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:05:32,202 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:05:32,202 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:05:32,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:05:32,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:05:32,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:05:32,203 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:05:32,203 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:05:32,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:05:32,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:05:32,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:05:32,205 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:05:32,205 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:05:32,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:05:32,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:05:32,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:05:32,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:05:32,274 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:05:32,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-07 07:05:32,336 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89980d2a3/c99769943a064d12895189539b1462e4/FLAG1427a37be [2018-11-07 07:05:32,978 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:05:32,979 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label29_true-unreach-call_false-termination.c [2018-11-07 07:05:33,002 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89980d2a3/c99769943a064d12895189539b1462e4/FLAG1427a37be [2018-11-07 07:05:33,024 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89980d2a3/c99769943a064d12895189539b1462e4 [2018-11-07 07:05:33,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:05:33,037 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:05:33,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:05:33,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:05:33,043 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:05:33,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dc7a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33, skipping insertion in model container [2018-11-07 07:05:33,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:05:33,123 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:05:33,612 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:05:33,617 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:05:33,766 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:05:33,788 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:05:33,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33 WrapperNode [2018-11-07 07:05:33,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:05:33,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:05:33,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:05:33,790 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:05:33,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:05:33,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:05:33,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:05:33,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:05:33,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:33,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:34,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... [2018-11-07 07:05:34,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:05:34,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:05:34,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:05:34,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:05:34,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:05:34,088 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:05:34,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:05:34,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:05:34,088 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:05:34,090 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:05:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:05:34,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:05:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:05:34,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:05:37,034 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:05:37,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:05:37 BoogieIcfgContainer [2018-11-07 07:05:37,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:05:37,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:05:37,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:05:37,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:05:37,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:05:33" (1/3) ... [2018-11-07 07:05:37,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db8b103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:05:37, skipping insertion in model container [2018-11-07 07:05:37,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:05:33" (2/3) ... [2018-11-07 07:05:37,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db8b103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:05:37, skipping insertion in model container [2018-11-07 07:05:37,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:05:37" (3/3) ... [2018-11-07 07:05:37,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label29_true-unreach-call_false-termination.c [2018-11-07 07:05:37,057 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:05:37,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:05:37,085 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:05:37,118 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:05:37,119 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:05:37,119 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:05:37,119 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:05:37,119 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:05:37,120 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:05:37,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:05:37,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:05:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 07:05:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-07 07:05:37,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:37,165 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:37,168 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:37,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2096081016, now seen corresponding path program 1 times [2018-11-07 07:05:37,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:37,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:37,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:37,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:37,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:37,881 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:05:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:38,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:38,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:38,095 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:38,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:38,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:38,123 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 07:05:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:39,683 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 07:05:39,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:39,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-07 07:05:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:39,704 INFO L225 Difference]: With dead ends: 550 [2018-11-07 07:05:39,704 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 07:05:39,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 07:05:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 07:05:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 07:05:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 07:05:39,785 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 108 [2018-11-07 07:05:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:39,786 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 07:05:39,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 07:05:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 07:05:39,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:39,793 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:39,793 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:39,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1737414697, now seen corresponding path program 1 times [2018-11-07 07:05:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:39,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:39,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:40,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:40,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:05:40,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:40,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:05:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:05:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:05:40,018 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 07:05:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:41,755 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 07:05:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:05:41,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-07 07:05:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:41,762 INFO L225 Difference]: With dead ends: 888 [2018-11-07 07:05:41,763 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 07:05:41,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 07:05:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 07:05:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 07:05:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 07:05:41,809 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 119 [2018-11-07 07:05:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:41,810 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 07:05:41,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:05:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 07:05:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 07:05:41,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:41,816 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:41,816 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1875739691, now seen corresponding path program 1 times [2018-11-07 07:05:41,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:41,821 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:42,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:42,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:05:42,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:42,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:05:42,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:05:42,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:05:42,295 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 07:05:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:43,716 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 07:05:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:05:43,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-07 07:05:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:43,720 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 07:05:43,721 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 07:05:43,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:05:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 07:05:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 07:05:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 07:05:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 07:05:43,746 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 120 [2018-11-07 07:05:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:43,746 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 07:05:43,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:05:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 07:05:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 07:05:43,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:43,750 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:43,750 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:43,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash 967812819, now seen corresponding path program 1 times [2018-11-07 07:05:43,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:43,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:43,752 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:44,659 WARN L179 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 07:05:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:44,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:44,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:05:44,820 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:44,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:05:44,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:05:44,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:05:44,821 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 07:05:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:47,038 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 07:05:47,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:05:47,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-07 07:05:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:47,044 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 07:05:47,044 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 07:05:47,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:05:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 07:05:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 07:05:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 07:05:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 07:05:47,069 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 121 [2018-11-07 07:05:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:47,069 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 07:05:47,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:05:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 07:05:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 07:05:47,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:47,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:47,073 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:47,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:47,073 INFO L82 PathProgramCache]: Analyzing trace with hash -394694497, now seen corresponding path program 1 times [2018-11-07 07:05:47,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:47,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:47,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:47,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:47,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:05:47,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:47,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:05:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:05:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:47,245 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 07:05:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:48,461 INFO L93 Difference]: Finished difference Result 1522 states and 2300 transitions. [2018-11-07 07:05:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:05:48,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-11-07 07:05:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:48,478 INFO L225 Difference]: With dead ends: 1522 [2018-11-07 07:05:48,478 INFO L226 Difference]: Without dead ends: 993 [2018-11-07 07:05:48,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:05:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-11-07 07:05:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2018-11-07 07:05:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2018-11-07 07:05:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1418 transitions. [2018-11-07 07:05:48,522 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1418 transitions. Word has length 126 [2018-11-07 07:05:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:48,522 INFO L480 AbstractCegarLoop]: Abstraction has 993 states and 1418 transitions. [2018-11-07 07:05:48,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:05:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1418 transitions. [2018-11-07 07:05:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 07:05:48,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:48,528 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:48,528 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:48,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash -97847665, now seen corresponding path program 1 times [2018-11-07 07:05:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:48,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:48,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:48,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:48,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:05:48,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:05:48,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:48,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:05:48,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:05:48,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:05:48,706 INFO L87 Difference]: Start difference. First operand 993 states and 1418 transitions. Second operand 6 states. [2018-11-07 07:05:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:49,737 INFO L93 Difference]: Finished difference Result 2917 states and 4405 transitions. [2018-11-07 07:05:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:05:49,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-07 07:05:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:49,759 INFO L225 Difference]: With dead ends: 2917 [2018-11-07 07:05:49,759 INFO L226 Difference]: Without dead ends: 1930 [2018-11-07 07:05:49,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:05:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-07 07:05:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1875. [2018-11-07 07:05:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-11-07 07:05:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2525 transitions. [2018-11-07 07:05:49,842 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2525 transitions. Word has length 134 [2018-11-07 07:05:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:49,843 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 2525 transitions. [2018-11-07 07:05:49,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:05:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2525 transitions. [2018-11-07 07:05:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 07:05:49,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:49,851 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:49,853 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:49,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -261653377, now seen corresponding path program 1 times [2018-11-07 07:05:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:49,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:49,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:49,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:50,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:50,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:50,116 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-11-07 07:05:50,119 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:50,167 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:50,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:50,818 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:05:50,819 INFO L272 AbstractInterpreter]: Visited 108 different actions 108 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 07:05:50,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:50,875 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:05:51,429 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 80.27% of their original sizes. [2018-11-07 07:05:51,430 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:05:51,687 INFO L415 sIntCurrentIteration]: We unified 141 AI predicates to 141 [2018-11-07 07:05:51,688 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:05:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-07 07:05:51,689 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:51,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:05:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:05:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:05:51,690 INFO L87 Difference]: Start difference. First operand 1875 states and 2525 transitions. Second operand 6 states. [2018-11-07 07:05:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:05:58,129 INFO L93 Difference]: Finished difference Result 3882 states and 5210 transitions. [2018-11-07 07:05:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 07:05:58,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-07 07:05:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:05:58,142 INFO L225 Difference]: With dead ends: 3882 [2018-11-07 07:05:58,142 INFO L226 Difference]: Without dead ends: 2013 [2018-11-07 07:05:58,150 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:05:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-11-07 07:05:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 2011. [2018-11-07 07:05:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2018-11-07 07:05:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2667 transitions. [2018-11-07 07:05:58,210 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2667 transitions. Word has length 142 [2018-11-07 07:05:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:05:58,211 INFO L480 AbstractCegarLoop]: Abstraction has 2011 states and 2667 transitions. [2018-11-07 07:05:58,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:05:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2667 transitions. [2018-11-07 07:05:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-07 07:05:58,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:05:58,217 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:05:58,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:05:58,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash 276654452, now seen corresponding path program 1 times [2018-11-07 07:05:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:05:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:58,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:05:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:05:58,220 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:05:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:05:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:05:58,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:05:58,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:05:58,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-11-07 07:05:58,641 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:05:58,646 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:05:58,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:05:58,935 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:05:58,936 INFO L272 AbstractInterpreter]: Visited 112 different actions 218 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 07:05:58,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:05:58,976 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:05:59,241 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 81.74% of their original sizes. [2018-11-07 07:05:59,241 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:05:59,779 INFO L415 sIntCurrentIteration]: We unified 143 AI predicates to 143 [2018-11-07 07:05:59,779 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:05:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:05:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:05:59,780 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:05:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:05:59,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:05:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:05:59,781 INFO L87 Difference]: Start difference. First operand 2011 states and 2667 transitions. Second operand 10 states. [2018-11-07 07:06:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:05,632 INFO L93 Difference]: Finished difference Result 4021 states and 5371 transitions. [2018-11-07 07:06:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:05,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2018-11-07 07:06:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:05,642 INFO L225 Difference]: With dead ends: 4021 [2018-11-07 07:06:05,642 INFO L226 Difference]: Without dead ends: 2152 [2018-11-07 07:06:05,649 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 151 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-11-07 07:06:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2149. [2018-11-07 07:06:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2149 states. [2018-11-07 07:06:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2815 transitions. [2018-11-07 07:06:05,712 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2815 transitions. Word has length 144 [2018-11-07 07:06:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:05,713 INFO L480 AbstractCegarLoop]: Abstraction has 2149 states and 2815 transitions. [2018-11-07 07:06:05,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2815 transitions. [2018-11-07 07:06:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 07:06:05,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:05,720 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2018-11-07 07:06:05,720 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:05,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1984849738, now seen corresponding path program 1 times [2018-11-07 07:06:05,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:05,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:05,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:05,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:05,722 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:06:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:05,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:05,966 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-07 07:06:05,967 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:05,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:05,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:06,225 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:06,225 INFO L272 AbstractInterpreter]: Visited 112 different actions 331 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 07:06:06,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:06,227 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:06,469 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 83.29% of their original sizes. [2018-11-07 07:06:06,470 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:06,588 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-07 07:06:06,588 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:06,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:06,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-07 07:06:06,589 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:06,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:06,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:06,590 INFO L87 Difference]: Start difference. First operand 2149 states and 2815 transitions. Second operand 10 states. [2018-11-07 07:06:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:13,799 INFO L93 Difference]: Finished difference Result 4990 states and 6655 transitions. [2018-11-07 07:06:13,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 07:06:13,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-11-07 07:06:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:13,812 INFO L225 Difference]: With dead ends: 4990 [2018-11-07 07:06:13,812 INFO L226 Difference]: Without dead ends: 3121 [2018-11-07 07:06:13,820 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:06:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2018-11-07 07:06:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3114. [2018-11-07 07:06:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2018-11-07 07:06:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 3950 transitions. [2018-11-07 07:06:13,892 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 3950 transitions. Word has length 184 [2018-11-07 07:06:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:13,892 INFO L480 AbstractCegarLoop]: Abstraction has 3114 states and 3950 transitions. [2018-11-07 07:06:13,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3950 transitions. [2018-11-07 07:06:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 07:06:13,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:13,902 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:06:13,902 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:13,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1715987142, now seen corresponding path program 1 times [2018-11-07 07:06:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:13,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:13,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:13,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-07 07:06:14,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:14,648 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:14,648 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-07 07:06:14,649 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:14,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:14,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:15,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:15,078 INFO L272 AbstractInterpreter]: Visited 115 different actions 462 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:06:15,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:15,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:15,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:15,107 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:06:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:15,118 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:15,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 07:06:15,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 14 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-07 07:06:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:06:16,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 07:06:16,578 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:06:16,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:06:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:06:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 07:06:16,580 INFO L87 Difference]: Start difference. First operand 3114 states and 3950 transitions. Second operand 12 states. [2018-11-07 07:06:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:23,937 INFO L93 Difference]: Finished difference Result 12891 states and 18909 transitions. [2018-11-07 07:06:23,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 07:06:23,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-11-07 07:06:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:23,993 INFO L225 Difference]: With dead ends: 12891 [2018-11-07 07:06:23,994 INFO L226 Difference]: Without dead ends: 10057 [2018-11-07 07:06:24,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-11-07 07:06:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2018-11-07 07:06:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 9647. [2018-11-07 07:06:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9647 states. [2018-11-07 07:06:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9647 states to 9647 states and 13205 transitions. [2018-11-07 07:06:24,385 INFO L78 Accepts]: Start accepts. Automaton has 9647 states and 13205 transitions. Word has length 201 [2018-11-07 07:06:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:24,386 INFO L480 AbstractCegarLoop]: Abstraction has 9647 states and 13205 transitions. [2018-11-07 07:06:24,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:06:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 9647 states and 13205 transitions. [2018-11-07 07:06:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 07:06:24,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:24,416 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:24,416 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:24,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash -332665990, now seen corresponding path program 1 times [2018-11-07 07:06:24,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:24,419 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 07:06:24,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:24,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:24,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-07 07:06:24,668 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:24,672 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:24,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:25,012 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:06:25,012 INFO L272 AbstractInterpreter]: Visited 114 different actions 334 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 07:06:25,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:25,050 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:06:25,354 INFO L227 lantSequenceWeakener]: Weakened 213 states. On average, predicates are now at 83.32% of their original sizes. [2018-11-07 07:06:25,354 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:06:26,003 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-07 07:06:26,003 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:06:26,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:06:26,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:06:26,003 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:06:26,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:06:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:06:26,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:06:26,004 INFO L87 Difference]: Start difference. First operand 9647 states and 13205 transitions. Second operand 10 states. [2018-11-07 07:06:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:33,995 INFO L93 Difference]: Finished difference Result 19847 states and 27077 transitions. [2018-11-07 07:06:33,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:06:33,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2018-11-07 07:06:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:34,058 INFO L225 Difference]: With dead ends: 19847 [2018-11-07 07:06:34,058 INFO L226 Difference]: Without dead ends: 10480 [2018-11-07 07:06:34,097 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 223 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:06:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10480 states. [2018-11-07 07:06:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10480 to 10473. [2018-11-07 07:06:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10473 states. [2018-11-07 07:06:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10473 states to 10473 states and 14120 transitions. [2018-11-07 07:06:34,410 INFO L78 Accepts]: Start accepts. Automaton has 10473 states and 14120 transitions. Word has length 216 [2018-11-07 07:06:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:34,410 INFO L480 AbstractCegarLoop]: Abstraction has 10473 states and 14120 transitions. [2018-11-07 07:06:34,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:06:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10473 states and 14120 transitions. [2018-11-07 07:06:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-07 07:06:34,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:06:34,449 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:06:34,450 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:06:34,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:34,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1069555424, now seen corresponding path program 1 times [2018-11-07 07:06:34,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:06:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:06:34,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:06:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 187 proven. 53 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 07:06:35,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:35,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:06:35,395 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2018-11-07 07:06:35,396 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [501], [503], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 07:06:35,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:06:35,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:06:35,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:06:35,725 INFO L272 AbstractInterpreter]: Visited 115 different actions 459 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 07:06:35,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:06:35,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:06:35,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:06:35,730 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:06:35,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:06:35,739 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:06:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:06:35,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:06:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 172 proven. 27 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 07:06:35,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:06:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 07:06:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:06:36,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-11-07 07:06:36,533 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:06:36,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 07:06:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 07:06:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-07 07:06:36,535 INFO L87 Difference]: Start difference. First operand 10473 states and 14120 transitions. Second operand 11 states. [2018-11-07 07:06:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:06:39,576 INFO L93 Difference]: Finished difference Result 20858 states and 30720 transitions. [2018-11-07 07:06:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-07 07:06:39,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 238 [2018-11-07 07:06:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:06:39,584 INFO L225 Difference]: With dead ends: 20858 [2018-11-07 07:06:39,584 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:06:39,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 490 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 07:06:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:06:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:06:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:06:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:06:39,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 238 [2018-11-07 07:06:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:06:39,675 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:06:39,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 07:06:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:06:39,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:06:39,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:06:40,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:40,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,309 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 385 DAG size of output: 215 [2018-11-07 07:06:41,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:41,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:06:42,177 WARN L179 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 370 DAG size of output: 205 [2018-11-07 07:06:42,687 WARN L179 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-11-07 07:06:43,521 WARN L179 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2018-11-07 07:06:45,548 WARN L179 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 257 DAG size of output: 90 [2018-11-07 07:06:47,221 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 228 DAG size of output: 71 [2018-11-07 07:06:48,429 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 218 DAG size of output: 71 [2018-11-07 07:06:48,431 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:06:48,432 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= |old(~a16~0)| ~a16~0)) [2018-11-07 07:06:48,432 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:06:48,432 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 07:06:48,432 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 07:06:48,432 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,432 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 07:06:48,433 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,434 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 07:06:48,435 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 07:06:48,436 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 07:06:48,437 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 07:06:48,438 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 07:06:48,439 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 07:06:48,440 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,441 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 07:06:48,442 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,443 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 07:06:48,444 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 07:06:48,445 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2018-11-07 07:06:48,446 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse22 (= 4 |old(~a16~0)|))) (let ((.cse7 (= 13 |old(~a8~0)|)) (.cse1 (= ~a7~0 |old(~a7~0)|)) (.cse2 (= |old(~a8~0)| ~a8~0)) (.cse3 (= |old(~a20~0)| ~a20~0)) (.cse23 (= ~a17~0 |old(~a17~0)|)) (.cse4 (<= ~a21~0 |old(~a21~0)|)) (.cse5 (= |old(~a16~0)| ~a16~0)) (.cse24 (not .cse22)) (.cse10 (not (= 0 |old(~a7~0)|))) (.cse11 (not (= 1 |old(~a21~0)|))) (.cse21 (not (= 1 |old(~a20~0)|))) (.cse13 (not (= 15 |old(~a8~0)|)))) (let ((.cse18 (< 0 |old(~a21~0)|)) (.cse19 (and (or .cse10 .cse11 .cse13 (not (= 0 |old(~a17~0)|)) .cse24 (not (= 0 |old(~a20~0)|))) (or .cse10 .cse11 .cse21 .cse13))) (.cse14 (= 0 |old(~a16~0)|)) (.cse12 (= ~a21~0 1)) (.cse15 (= |calculate_output_#in~input| 0)) (.cse16 (= 6 |old(~a16~0)|)) (.cse17 (and .cse1 .cse2 .cse3 .cse23 .cse4 .cse5)) (.cse20 (< 0 |old(~a17~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse8 (not (= 8 ~a12~0))) (.cse25 (= 1 ~a20~0)) (.cse26 (= 13 ~a8~0)) (.cse27 (= 1 ~a21~0)) (.cse6 (= 1 ~a17~0)) (.cse28 (not .cse7)) (.cse9 (not (= 1 |old(~a17~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse8 .cse15 .cse9) (or .cse16 .cse8 .cse17 .cse18) (or .cse19 .cse14 .cse8 .cse20 .cse15 .cse12) (or .cse21 .cse17 .cse8 .cse20 .cse18) (or .cse16 .cse17 .cse7 .cse8 .cse20) (or .cse0 .cse7 .cse8 .cse20 .cse17) (or .cse0 .cse22 .cse21 .cse8 (and .cse3 .cse5 .cse1 .cse2 .cse23 .cse4) .cse9) (or (and .cse5 .cse12 (= ~a7~0 0) .cse2 .cse23 (= ~a20~0 1)) (or .cse22 .cse19 .cse14 .cse8 .cse15)) (or .cse10 .cse11 .cse22 .cse13 .cse14 .cse12 .cse8 .cse20 .cse15) (or .cse16 .cse0 .cse8 .cse17 .cse20) (or .cse11 .cse21 .cse24 (and (= 1 ~a7~0) .cse25 .cse26 .cse5 .cse27 .cse6) .cse8 (not .cse0) .cse28 .cse9) (or .cse11 .cse0 .cse21 .cse24 .cse8 (and (not (= ~a7~0 1)) .cse25 .cse26 .cse5 .cse27 .cse6) .cse28 .cse9))))) [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 07:06:48,447 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,448 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 07:06:48,449 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 07:06:48,450 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:06:48,451 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a8~0 15) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= 1 ~a17~0) (= ~a16~0 5)) [2018-11-07 07:06:48,452 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:06:48,452 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:06:48,452 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)) (and (= ~a21~0 1) (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5))) [2018-11-07 07:06:48,452 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:06:48,452 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse2 (not (= ~a8~0 13))) (.cse1 (<= ~a17~0 0)) (.cse6 (<= ~a21~0 0)) (.cse0 (not (= ~a16~0 6))) (.cse5 (not (= ~a7~0 1))) (.cse3 (= 1 ~a20~0)) (.cse7 (not (= ~a16~0 4))) (.cse4 (= 1 ~a17~0))) (or (and .cse0 .cse1 .cse2) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse4) (and .cse5 .cse0 .cse1) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse5 .cse2 .cse4) (and .cse5 .cse1 .cse2) (and .cse6 (= |old(~a20~0)| ~a20~0) .cse1) (not (= 0 |old(~a7~0)|)) (and .cse6 .cse0) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (not (= main_~input~0 0)) (= ~a21~0 1) (and (= ~a7~0 0) (not (= ~a16~0 0)) (= ~a8~0 15) (= ~a20~0 1)) .cse7) (and .cse5 .cse3 .cse7 .cse4))) [2018-11-07 07:06:48,452 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 07:06:48,452 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 07:06:48,453 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 07:06:48,453 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a8~0 13))) (.cse1 (<= ~a17~0 0)) (.cse6 (<= ~a21~0 0)) (.cse0 (not (= ~a16~0 6))) (.cse5 (not (= ~a7~0 1))) (.cse3 (= 1 ~a20~0)) (.cse7 (not (= ~a16~0 4))) (.cse4 (= 1 ~a17~0))) (or (and .cse0 .cse1 .cse2) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse3 (= 13 ~a8~0) (= 4 ~a16~0) (= 1 ~a21~0) .cse4) (and .cse5 .cse0 .cse1) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (and .cse5 .cse2 .cse4) (and .cse5 .cse1 .cse2) (and .cse6 (= |old(~a20~0)| ~a20~0) .cse1) (not (= 0 |old(~a7~0)|)) (and .cse6 .cse0) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and (not (= main_~input~0 0)) (= ~a21~0 1) (and (= ~a7~0 0) (not (= ~a16~0 0)) (= ~a8~0 15) (= ~a20~0 1)) .cse7) (and .cse5 .cse3 .cse7 .cse4))) [2018-11-07 07:06:48,453 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 07:06:48,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:06:48 BoogieIcfgContainer [2018-11-07 07:06:48,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:06:48,469 INFO L168 Benchmark]: Toolchain (without parser) took 75432.28 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-07 07:06:48,470 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:06:48,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.71 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 07:06:48,471 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.1 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:48,472 INFO L168 Benchmark]: Boogie Preprocessor took 95.23 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:06:48,473 INFO L168 Benchmark]: RCFGBuilder took 3022.47 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. [2018-11-07 07:06:48,474 INFO L168 Benchmark]: TraceAbstraction took 71431.20 ms. Allocated memory was 2.2 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -497.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-07 07:06:48,479 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.71 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.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.1 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.23 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3022.47 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71431.20 ms. Allocated memory was 2.2 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -497.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && a17 <= 0) && !(a8 == 13)) || !(1 == \old(a20))) || !(5 == \old(a16))) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && !(a16 == 6)) && a17 <= 0)) || !(1 == \old(a21))) || !(8 == a12)) || ((!(a7 == 1) && !(a8 == 13)) && 1 == a17)) || ((!(a7 == 1) && a17 <= 0) && !(a8 == 13))) || ((a21 <= 0 && \old(a20) == a20) && a17 <= 0)) || !(0 == \old(a7))) || (a21 <= 0 && !(a16 == 6))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((!(input == 0) && a21 == 1) && ((a7 == 0 && !(a16 == 0)) && a8 == 15) && a20 == 1) && !(a16 == 4))) || (((!(a7 == 1) && 1 == a20) && !(a16 == 4)) && 1 == a17) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 71.3s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 47.5s AutomataDifference, 0.0s DeadEndRemovalTime, 8.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1446 SDtfs, 11287 SDslu, 2537 SDs, 0 SdLazy, 12737 SolverSat, 2632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1760 GetRequests, 1590 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10473occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.5s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9973953069769672 AbsIntWeakeningRatio, 0.21407624633431085 AbsIntAvgWeakeningVarsNumRemoved, 27.733137829912025 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 499 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 560 PreInvPairs, 1054 NumberOfFragments, 933 HoareAnnotationTreeSize, 560 FomulaSimplifications, 27696 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19756 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2292 NumberOfCodeBlocks, 2292 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1620041 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1215 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1481/1734 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...