java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:49:18,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:49:18,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:49:18,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:49:18,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:49:18,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:49:18,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:49:18,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:49:18,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:49:18,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:49:18,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:49:18,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:49:18,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:49:18,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:49:18,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:49:18,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:49:18,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:49:18,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:49:18,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:49:18,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:49:18,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:49:18,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:49:18,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:49:18,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:49:18,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:49:18,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:49:18,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:49:18,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:49:18,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:49:18,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:49:18,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:49:18,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:49:18,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:49:18,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:49:18,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:49:18,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:49:18,074 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:49:18,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:49:18,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:49:18,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:49:18,100 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:49:18,100 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:49:18,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:49:18,101 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:49:18,101 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:49:18,101 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:49:18,101 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:49:18,102 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:49:18,102 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:49:18,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:49:18,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:49:18,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:49:18,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:49:18,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:49:18,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:49:18,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:49:18,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:49:18,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:49:18,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:49:18,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:49:18,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:49:18,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:49:18,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:49:18,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:49:18,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:49:18,107 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:49:18,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:49:18,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:49:18,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:49:18,108 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:49:18,108 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:49:18,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:49:18,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:49:18,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:49:18,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:49:18,197 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:49:18,198 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c [2018-11-07 12:49:18,259 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019e91917/8dbda317ed4143f5903a01220f0e3993/FLAG5540ea322 [2018-11-07 12:49:18,882 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:49:18,889 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label40_true-unreach-call_false-termination.c [2018-11-07 12:49:18,902 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019e91917/8dbda317ed4143f5903a01220f0e3993/FLAG5540ea322 [2018-11-07 12:49:18,919 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019e91917/8dbda317ed4143f5903a01220f0e3993 [2018-11-07 12:49:18,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:49:18,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:49:18,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:49:18,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:49:18,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:49:18,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:49:18" (1/1) ... [2018-11-07 12:49:18,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b7df7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:18, skipping insertion in model container [2018-11-07 12:49:18,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:49:18" (1/1) ... [2018-11-07 12:49:18,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:49:19,009 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:49:19,556 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:49:19,561 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:49:19,692 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:49:19,713 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:49:19,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19 WrapperNode [2018-11-07 12:49:19,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:49:19,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:49:19,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:49:19,715 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:49:19,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:49:19,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:49:19,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:49:19,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:49:19,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... [2018-11-07 12:49:19,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:49:19,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:49:19,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:49:19,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:49:19,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:49:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:49:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:49:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:49:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:49:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:49:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:49:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:49:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:49:20,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:49:23,252 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:49:23,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:49:23 BoogieIcfgContainer [2018-11-07 12:49:23,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:49:23,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:49:23,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:49:23,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:49:23,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:49:18" (1/3) ... [2018-11-07 12:49:23,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da00395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:49:23, skipping insertion in model container [2018-11-07 12:49:23,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:49:19" (2/3) ... [2018-11-07 12:49:23,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da00395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:49:23, skipping insertion in model container [2018-11-07 12:49:23,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:49:23" (3/3) ... [2018-11-07 12:49:23,270 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label40_true-unreach-call_false-termination.c [2018-11-07 12:49:23,281 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:49:23,291 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:49:23,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:49:23,364 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:49:23,365 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:49:23,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:49:23,365 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:49:23,365 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:49:23,365 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:49:23,366 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:49:23,366 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:49:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:49:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-07 12:49:23,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:23,426 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] [2018-11-07 12:49:23,428 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:23,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 861402336, now seen corresponding path program 1 times [2018-11-07 12:49:23,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:23,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:23,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:23,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:24,031 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:49:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:49:24,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:24,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:49:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:49:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:49:24,196 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:49:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:25,738 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:49:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:49:25,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-11-07 12:49:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:25,761 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:49:25,762 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:49:25,769 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 12:49:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:49:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:49:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:49:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-07 12:49:25,846 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 94 [2018-11-07 12:49:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:25,847 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-07 12:49:25,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:49:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-07 12:49:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-07 12:49:25,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:25,854 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:25,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:25,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash -461810857, now seen corresponding path program 1 times [2018-11-07 12:49:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:25,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:25,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:25,857 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:49:26,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:49:26,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:26,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:49:26,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:49:26,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:49:26,093 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-07 12:49:27,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:27,956 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-07 12:49:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:49:27,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-07 12:49:27,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:27,964 INFO L225 Difference]: With dead ends: 1079 [2018-11-07 12:49:27,965 INFO L226 Difference]: Without dead ends: 745 [2018-11-07 12:49:27,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 12:49:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-07 12:49:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-07 12:49:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-07 12:49:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-07 12:49:28,035 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 104 [2018-11-07 12:49:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:28,036 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-07 12:49:28,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:49:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-07 12:49:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 12:49:28,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:28,043 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:28,043 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:28,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1700574034, now seen corresponding path program 1 times [2018-11-07 12:49:28,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:28,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:28,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:28,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:49:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:28,205 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:28,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-11-07 12:49:28,208 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:28,260 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:28,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:32,640 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:32,642 INFO L272 AbstractInterpreter]: Visited 98 different actions 163 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:49:32,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:32,697 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:34,431 INFO L227 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 80.06% of their original sizes. [2018-11-07 12:49:34,432 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:35,293 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-11-07 12:49:35,293 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:35,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:35,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:49:35,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:35,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:49:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:49:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:49:35,296 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 11 states. [2018-11-07 12:49:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:49:48,688 INFO L93 Difference]: Finished difference Result 2333 states and 3723 transitions. [2018-11-07 12:49:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:49:48,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 130 [2018-11-07 12:49:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:49:48,704 INFO L225 Difference]: With dead ends: 2333 [2018-11-07 12:49:48,704 INFO L226 Difference]: Without dead ends: 1606 [2018-11-07 12:49:48,708 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:49:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-11-07 12:49:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1579. [2018-11-07 12:49:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-11-07 12:49:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2094 transitions. [2018-11-07 12:49:48,765 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2094 transitions. Word has length 130 [2018-11-07 12:49:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:49:48,766 INFO L480 AbstractCegarLoop]: Abstraction has 1579 states and 2094 transitions. [2018-11-07 12:49:48,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:49:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2094 transitions. [2018-11-07 12:49:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 12:49:48,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:49:48,772 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:49:48,772 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:49:48,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash 109773897, now seen corresponding path program 1 times [2018-11-07 12:49:48,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:49:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:49:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:49:48,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:49:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:49:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 52 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 12:49:49,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:49:49,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:49:49,075 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-07 12:49:49,076 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:49:49,087 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:49:49,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:49:50,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:49:50,830 INFO L272 AbstractInterpreter]: Visited 99 different actions 166 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 12:49:50,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:49:50,839 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:49:52,306 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 80.77% of their original sizes. [2018-11-07 12:49:52,307 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:49:52,979 INFO L415 sIntCurrentIteration]: We unified 142 AI predicates to 142 [2018-11-07 12:49:52,979 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:49:52,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:49:52,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-11-07 12:49:52,980 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:49:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 12:49:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 12:49:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-07 12:49:52,982 INFO L87 Difference]: Start difference. First operand 1579 states and 2094 transitions. Second operand 19 states. [2018-11-07 12:50:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:16,554 INFO L93 Difference]: Finished difference Result 3437 states and 4621 transitions. [2018-11-07 12:50:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:50:16,554 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2018-11-07 12:50:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:16,564 INFO L225 Difference]: With dead ends: 3437 [2018-11-07 12:50:16,564 INFO L226 Difference]: Without dead ends: 2000 [2018-11-07 12:50:16,568 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-07 12:50:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-11-07 12:50:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1990. [2018-11-07 12:50:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2018-11-07 12:50:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2546 transitions. [2018-11-07 12:50:16,631 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2546 transitions. Word has length 143 [2018-11-07 12:50:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:16,631 INFO L480 AbstractCegarLoop]: Abstraction has 1990 states and 2546 transitions. [2018-11-07 12:50:16,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 12:50:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2546 transitions. [2018-11-07 12:50:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 12:50:16,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:16,637 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:16,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:16,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:16,638 INFO L82 PathProgramCache]: Analyzing trace with hash -604261450, now seen corresponding path program 1 times [2018-11-07 12:50:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:16,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:16,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:16,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:50:16,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:16,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:16,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-07 12:50:16,793 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:16,797 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:16,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:19,305 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:19,305 INFO L272 AbstractInterpreter]: Visited 100 different actions 272 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:50:19,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:19,312 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:20,097 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 80.13% of their original sizes. [2018-11-07 12:50:20,097 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:20,264 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-07 12:50:20,264 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:20,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:20,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 12:50:20,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:20,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 12:50:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 12:50:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:50:20,266 INFO L87 Difference]: Start difference. First operand 1990 states and 2546 transitions. Second operand 10 states. [2018-11-07 12:50:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:30,644 INFO L93 Difference]: Finished difference Result 3640 states and 4785 transitions. [2018-11-07 12:50:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:50:30,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-11-07 12:50:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:30,655 INFO L225 Difference]: With dead ends: 3640 [2018-11-07 12:50:30,655 INFO L226 Difference]: Without dead ends: 2203 [2018-11-07 12:50:30,660 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 162 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:50:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2018-11-07 12:50:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1911. [2018-11-07 12:50:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2018-11-07 12:50:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2483 transitions. [2018-11-07 12:50:30,718 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2483 transitions. Word has length 155 [2018-11-07 12:50:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:30,718 INFO L480 AbstractCegarLoop]: Abstraction has 1911 states and 2483 transitions. [2018-11-07 12:50:30,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 12:50:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2483 transitions. [2018-11-07 12:50:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 12:50:30,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:30,725 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-07 12:50:30,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:30,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash 285185945, now seen corresponding path program 1 times [2018-11-07 12:50:30,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:30,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:30,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 12:50:30,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:30,974 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:30,974 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-07 12:50:30,974 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [65], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:30,978 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:30,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:35,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:50:35,433 INFO L272 AbstractInterpreter]: Visited 102 different actions 487 times. Merged at 10 different actions 50 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:50:35,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:35,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:50:35,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:35,436 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:50:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:35,451 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:50:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:35,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:50:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-07 12:50:35,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:50:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-07 12:50:36,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:50:36,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:50:36,908 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:50:36,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:50:36,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:50:36,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:50:36,910 INFO L87 Difference]: Start difference. First operand 1911 states and 2483 transitions. Second operand 8 states. [2018-11-07 12:50:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:42,169 INFO L93 Difference]: Finished difference Result 6177 states and 8806 transitions. [2018-11-07 12:50:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:50:42,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2018-11-07 12:50:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:42,190 INFO L225 Difference]: With dead ends: 6177 [2018-11-07 12:50:42,191 INFO L226 Difference]: Without dead ends: 2934 [2018-11-07 12:50:42,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:50:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2018-11-07 12:50:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2749. [2018-11-07 12:50:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2018-11-07 12:50:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3361 transitions. [2018-11-07 12:50:42,308 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3361 transitions. Word has length 175 [2018-11-07 12:50:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:42,309 INFO L480 AbstractCegarLoop]: Abstraction has 2749 states and 3361 transitions. [2018-11-07 12:50:42,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:50:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3361 transitions. [2018-11-07 12:50:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 12:50:42,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:42,321 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:50:42,321 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:42,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:42,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1011492385, now seen corresponding path program 1 times [2018-11-07 12:50:42,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:42,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:42,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:42,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:50:42,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:50:42,570 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:50:42,570 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-11-07 12:50:42,570 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], [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], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:50:42,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:50:42,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:50:45,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:50:45,703 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 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 12:50:45,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:45,743 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:50:49,361 INFO L227 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 80.34% of their original sizes. [2018-11-07 12:50:49,361 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:50:50,498 INFO L415 sIntCurrentIteration]: We unified 224 AI predicates to 224 [2018-11-07 12:50:50,499 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:50:50,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:50:50,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2018-11-07 12:50:50,499 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:50,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 12:50:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 12:50:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-11-07 12:50:50,501 INFO L87 Difference]: Start difference. First operand 2749 states and 3361 transitions. Second operand 26 states. [2018-11-07 12:51:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:15,023 INFO L93 Difference]: Finished difference Result 5837 states and 7167 transitions. [2018-11-07 12:51:15,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 12:51:15,023 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 225 [2018-11-07 12:51:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:15,038 INFO L225 Difference]: With dead ends: 5837 [2018-11-07 12:51:15,038 INFO L226 Difference]: Without dead ends: 3094 [2018-11-07 12:51:15,047 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 243 GetRequests, 191 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 12:51:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2018-11-07 12:51:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2812. [2018-11-07 12:51:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2018-11-07 12:51:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 3427 transitions. [2018-11-07 12:51:15,121 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 3427 transitions. Word has length 225 [2018-11-07 12:51:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:15,122 INFO L480 AbstractCegarLoop]: Abstraction has 2812 states and 3427 transitions. [2018-11-07 12:51:15,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 12:51:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3427 transitions. [2018-11-07 12:51:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-07 12:51:15,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:15,134 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:15,134 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:15,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash -791452258, now seen corresponding path program 1 times [2018-11-07 12:51:15,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:15,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:15,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:15,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 139 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:51:15,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:15,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:15,749 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-11-07 12:51:15,749 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], [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], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:15,752 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:15,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:20,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:51:20,874 INFO L272 AbstractInterpreter]: Visited 101 different actions 479 times. Merged at 9 different actions 48 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:51:20,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:20,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:51:20,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:20,882 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:51:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:20,891 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:51:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:21,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:51:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-07 12:51:21,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:51:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-07 12:51:21,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:51:21,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 12:51:21,749 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:51:21,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:51:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:51:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-07 12:51:21,750 INFO L87 Difference]: Start difference. First operand 2812 states and 3427 transitions. Second operand 11 states. [2018-11-07 12:51:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:24,742 INFO L93 Difference]: Finished difference Result 10324 states and 13242 transitions. [2018-11-07 12:51:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 12:51:24,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2018-11-07 12:51:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:24,779 INFO L225 Difference]: With dead ends: 10324 [2018-11-07 12:51:24,780 INFO L226 Difference]: Without dead ends: 7717 [2018-11-07 12:51:24,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 471 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:51:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7717 states. [2018-11-07 12:51:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7717 to 7684. [2018-11-07 12:51:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2018-11-07 12:51:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9369 transitions. [2018-11-07 12:51:25,009 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9369 transitions. Word has length 234 [2018-11-07 12:51:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 7684 states and 9369 transitions. [2018-11-07 12:51:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:51:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9369 transitions. [2018-11-07 12:51:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-07 12:51:25,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:25,043 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:25,044 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:25,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1003107116, now seen corresponding path program 1 times [2018-11-07 12:51:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:25,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:25,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 161 proven. 72 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 12:51:25,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:25,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:25,563 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-11-07 12:51:25,564 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], [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], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:25,566 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:25,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:28,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:28,206 INFO L272 AbstractInterpreter]: Visited 100 different actions 265 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 12:51:28,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:28,212 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:29,715 INFO L227 lantSequenceWeakener]: Weakened 240 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-07 12:51:29,716 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:29,802 INFO L415 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2018-11-07 12:51:29,802 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:29,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:29,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:51:29,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:29,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:51:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:51:29,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:51:29,804 INFO L87 Difference]: Start difference. First operand 7684 states and 9369 transitions. Second operand 11 states. [2018-11-07 12:51:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:36,385 INFO L93 Difference]: Finished difference Result 15167 states and 18556 transitions. [2018-11-07 12:51:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:51:36,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 243 [2018-11-07 12:51:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:36,419 INFO L225 Difference]: With dead ends: 15167 [2018-11-07 12:51:36,419 INFO L226 Difference]: Without dead ends: 7826 [2018-11-07 12:51:36,449 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:51:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2018-11-07 12:51:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7822. [2018-11-07 12:51:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7822 states. [2018-11-07 12:51:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 9517 transitions. [2018-11-07 12:51:36,678 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 9517 transitions. Word has length 243 [2018-11-07 12:51:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:36,679 INFO L480 AbstractCegarLoop]: Abstraction has 7822 states and 9517 transitions. [2018-11-07 12:51:36,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:51:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 9517 transitions. [2018-11-07 12:51:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 12:51:36,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:36,709 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 3, 3, 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] [2018-11-07 12:51:36,710 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:36,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1953014093, now seen corresponding path program 1 times [2018-11-07 12:51:36,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:36,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:36,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:36,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 163 proven. 15 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-07 12:51:37,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:37,109 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:37,109 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-11-07 12:51:37,109 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], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:37,111 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:37,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:39,264 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:39,265 INFO L272 AbstractInterpreter]: Visited 99 different actions 165 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 12:51:39,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:39,272 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:40,419 INFO L227 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 80.05% of their original sizes. [2018-11-07 12:51:40,420 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:40,534 INFO L415 sIntCurrentIteration]: We unified 246 AI predicates to 246 [2018-11-07 12:51:40,534 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:40,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:40,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:51:40,535 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:40,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:51:40,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:51:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:51:40,536 INFO L87 Difference]: Start difference. First operand 7822 states and 9517 transitions. Second operand 11 states. [2018-11-07 12:51:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:48,167 INFO L93 Difference]: Finished difference Result 15302 states and 18694 transitions. [2018-11-07 12:51:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:51:48,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2018-11-07 12:51:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:48,193 INFO L225 Difference]: With dead ends: 15302 [2018-11-07 12:51:48,193 INFO L226 Difference]: Without dead ends: 7961 [2018-11-07 12:51:48,212 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 255 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:51:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7961 states. [2018-11-07 12:51:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7961 to 7960. [2018-11-07 12:51:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7960 states. [2018-11-07 12:51:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 9662 transitions. [2018-11-07 12:51:48,380 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 9662 transitions. Word has length 247 [2018-11-07 12:51:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:48,380 INFO L480 AbstractCegarLoop]: Abstraction has 7960 states and 9662 transitions. [2018-11-07 12:51:48,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:51:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 9662 transitions. [2018-11-07 12:51:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-07 12:51:48,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:48,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, 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, 3, 3, 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] [2018-11-07 12:51:48,416 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:48,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -838571264, now seen corresponding path program 1 times [2018-11-07 12:51:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:48,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:48,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 161 proven. 84 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 12:51:49,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:49,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:49,014 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-11-07 12:51:49,014 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], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:49,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:49,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:51,643 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:51,643 INFO L272 AbstractInterpreter]: Visited 100 different actions 268 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:51:51,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:51,650 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:53,222 INFO L227 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 80.08% of their original sizes. [2018-11-07 12:51:53,223 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:53,317 INFO L415 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2018-11-07 12:51:53,317 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:53,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:53,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 12:51:53,318 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:53,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:51:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:51:53,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:51:53,319 INFO L87 Difference]: Start difference. First operand 7960 states and 9662 transitions. Second operand 11 states. [2018-11-07 12:52:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:01,505 INFO L93 Difference]: Finished difference Result 16420 states and 20011 transitions. [2018-11-07 12:52:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 12:52:01,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 256 [2018-11-07 12:52:01,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:01,533 INFO L225 Difference]: With dead ends: 16420 [2018-11-07 12:52:01,533 INFO L226 Difference]: Without dead ends: 8941 [2018-11-07 12:52:01,549 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 265 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 12:52:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8941 states. [2018-11-07 12:52:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8941 to 8923. [2018-11-07 12:52:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8923 states. [2018-11-07 12:52:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8923 states to 8923 states and 10720 transitions. [2018-11-07 12:52:01,742 INFO L78 Accepts]: Start accepts. Automaton has 8923 states and 10720 transitions. Word has length 256 [2018-11-07 12:52:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:01,742 INFO L480 AbstractCegarLoop]: Abstraction has 8923 states and 10720 transitions. [2018-11-07 12:52:01,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:52:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8923 states and 10720 transitions. [2018-11-07 12:52:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-07 12:52:01,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:01,770 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:52:01,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:01,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash 378234234, now seen corresponding path program 1 times [2018-11-07 12:52:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:01,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:02,716 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 12:52:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 216 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 12:52:02,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:02,937 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:02,938 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-11-07 12:52:02,938 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], [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], [261], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:52:02,940 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:02,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:09,995 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:52:09,996 INFO L272 AbstractInterpreter]: Visited 101 different actions 784 times. Merged at 9 different actions 83 times. Widened at 1 different actions 4 times. Found 19 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:52:10,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:10,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:52:10,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:10,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:52:10,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:10,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:52:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:10,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:52:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-07 12:52:10,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:52:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-07 12:52:10,685 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:10,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:52:10,685 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:10,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:52:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:52:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:52:10,686 INFO L87 Difference]: Start difference. First operand 8923 states and 10720 transitions. Second operand 3 states. [2018-11-07 12:52:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:11,618 INFO L93 Difference]: Finished difference Result 21712 states and 26586 transitions. [2018-11-07 12:52:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:52:11,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-11-07 12:52:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:11,624 INFO L225 Difference]: With dead ends: 21712 [2018-11-07 12:52:11,624 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:52:11,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:52:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:52:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:52:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:52:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:52:11,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2018-11-07 12:52:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:11,669 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:52:11,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:52:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:52:11,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:52:11,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:52:11,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,378 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 182 [2018-11-07 12:52:12,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:52:12,787 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 169 [2018-11-07 12:52:13,168 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-11-07 12:52:15,224 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2018-11-07 12:52:19,938 WARN L179 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 441 DAG size of output: 128 [2018-11-07 12:52:20,548 WARN L179 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 89 [2018-11-07 12:52:20,858 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 89 [2018-11-07 12:52:20,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:52:20,861 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)) [2018-11-07 12:52:20,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:52:20,861 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:52:20,861 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:52:20,862 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:52:20,863 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:52:20,864 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:52:20,865 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,866 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:52:20,867 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:52:20,868 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:52:20,869 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:52:20,870 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,871 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:52:20,872 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,873 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:52:20,874 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:52:20,875 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:52:20,876 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:52:20,877 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse24 (= ~a7~0 |old(~a7~0)|)) (.cse22 (= |old(~a8~0)| ~a8~0)) (.cse23 (= |old(~a20~0)| ~a20~0)) (.cse33 (<= ~a16~0 5)) (.cse12 (= ~a21~0 1)) (.cse34 (<= 4 ~a16~0))) (let ((.cse14 (= ~a16~0 5)) (.cse1 (not (= 5 |old(~a16~0)|))) (.cse26 (< 15 |old(~a8~0)|)) (.cse30 (< 1 |old(~a7~0)|)) (.cse27 (and .cse33 .cse12 .cse34)) (.cse31 (< |old(~a8~0)| 13)) (.cse32 (< |old(~a7~0)| 0)) (.cse17 (= 6 |old(~a16~0)|)) (.cse18 (< |old(~a20~0)| 0)) (.cse28 (< 5 |old(~a16~0)|)) (.cse29 (< |old(~a16~0)| 4)) (.cse19 (< 0 |old(~a20~0)|)) (.cse25 (and .cse24 .cse22 .cse23)) (.cse13 (= ~a17~0 1)) (.cse20 (< |old(~a20~0)| 1)) (.cse11 (= ~a16~0 4)) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse4 (not (= 4 |old(~a16~0)|))) (.cse16 (= 13 |old(~a8~0)|)) (.cse2 (not (= 1 |old(~a17~0)|))) (.cse21 (not (= 1 |old(~a7~0)|))) (.cse15 (< |calculate_output_#in~input| 1)) (.cse5 (not (= 0 |old(~a7~0)|))) (.cse6 (not (= 1 |old(~a21~0)|))) (.cse8 (not (= 15 |old(~a8~0)|))) (.cse3 (not (= 0 |old(~a17~0)|))) (.cse9 (not (= 8 ~a12~0))) (.cse7 (not (= 1 |old(~a20~0)|))) (.cse10 (= ~a17~0 0))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse4)) (or .cse5 .cse6 .cse7 .cse8 .cse9) (or (and .cse10 .cse11 .cse12) (and .cse13 .cse12 .cse14)) .cse15) (or .cse13 .cse16 .cse2) (or .cse17 (not (= ~a16~0 6))) (or .cse0 .cse14 (and (or .cse5 .cse6 .cse8 .cse3 (not (= 0 |old(~a20~0)|)) .cse1 .cse9) (or .cse5 .cse6 .cse8 .cse1 .cse9 .cse18 .cse2)) .cse19 .cse15) (or .cse20 .cse21 (and (= 1 ~a7~0) .cse22 .cse23)) (or .cse7 .cse2 (and .cse24 .cse22 .cse23 .cse13)) (or .cse17 .cse25) (or .cse0 .cse6 .cse26 .cse27 .cse9 .cse2 .cse7 .cse28 .cse29 .cse30 .cse31 .cse32 .cse15) (or .cse0 .cse6 .cse26 .cse16 .cse9 .cse18 .cse2 .cse28 .cse29 .cse30 .cse27 .cse31 .cse32 .cse19 .cse15) (or .cse17 .cse13 .cse2) (or .cse0 .cse5 .cse6 (and (<= 0 ~a17~0) .cse33 .cse12 (<= ~a17~0 1) .cse34) .cse9 (< 1 |old(~a17~0)|) .cse18 .cse8 .cse28 .cse29 (< |old(~a17~0)| 0) .cse19 .cse15) (or .cse25 .cse16) (or .cse13 .cse20 .cse21 .cse2) (or .cse11 .cse0 (or .cse6 .cse4 (not .cse16)) .cse9 .cse2 .cse7 .cse21 .cse15) (or (or .cse5 .cse6 (< 6 |old(~a16~0)|) (< |old(~a16~0)| 5) .cse8 .cse3 .cse9) .cse7 (and (<= 5 ~a16~0) .cse12 .cse10 (<= ~a16~0 6)))))) [2018-11-07 12:52:20,877 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:52:20,877 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,877 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,877 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:52:20,878 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,879 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:52:20,880 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 437) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:52:20,881 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:52:20,882 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:52:20,883 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:52:20,883 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:52:20,883 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:52:20,884 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a17~0 1) (= ~a7~0 |old(~a7~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:52:20,884 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:52:20,884 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (or (not (= ~a8~0 13)) (not (= ~a16~0 6)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= 1 ~a7~0) (<= 1 ~a20~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and (= |old(~a20~0)| ~a20~0) (= ~a17~0 1)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) [2018-11-07 12:52:20,884 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:52:20,884 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:52:20,884 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:52:20,884 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (or (not (= ~a8~0 13)) (not (= ~a16~0 6)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (and (= 1 ~a7~0) (<= 1 ~a20~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (and (= |old(~a20~0)| ~a20~0) (= ~a17~0 1)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) [2018-11-07 12:52:20,884 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:52:20,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:52:20 BoogieIcfgContainer [2018-11-07 12:52:20,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:52:20,906 INFO L168 Benchmark]: Toolchain (without parser) took 181974.70 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2018-11-07 12:52:20,907 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:52:20,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:52:20,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-11-07 12:52:20,909 INFO L168 Benchmark]: Boogie Preprocessor took 136.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-07 12:52:20,915 INFO L168 Benchmark]: RCFGBuilder took 3273.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:52:20,915 INFO L168 Benchmark]: TraceAbstraction took 177645.15 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -380.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-07 12:52:20,922 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.72 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 130.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -826.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.79 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3273.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 177645.15 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.5 GB in the end (delta: -380.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 437]: 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: (((((((((((((((((((((!(a8 == 13) || !(a16 == 6)) || !(\old(a21) == 1)) || !(b == 2)) || !(y == 25)) || (1 == a7 && 1 <= a20)) || !(x == 24)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(z == 26)) || !(\old(a16) == 5)) || !(0 == \old(a7))) || (\old(a20) == a20 && a17 == 1)) || !(3 == c)) || !(\old(a20) == 1)) || !(23 == w)) || !(a == 1)) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 177.5s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 107.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1916 SDtfs, 11956 SDslu, 2592 SDs, 0 SdLazy, 16119 SolverSat, 2539 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.1s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 2896 GetRequests, 2656 SyntacticMatches, 14 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8923occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 36.0s AbstIntTime, 10 AbstIntIterations, 7 AbstIntStrong, 0.9970183961817101 AbsIntWeakeningRatio, 0.21479885057471265 AbsIntAvgWeakeningVarsNumRemoved, 27.86278735632184 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 864 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 401 PreInvPairs, 627 NumberOfFragments, 902 HoareAnnotationTreeSize, 401 FomulaSimplifications, 20848 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10526 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2933 NumberOfCodeBlocks, 2933 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3583 ConstructedInterpolants, 0 QuantifiedInterpolants, 1483822 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1883 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 2953/3385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...