java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:36:32,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:36:32,430 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:36:32,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:36:32,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:36:32,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:36:32,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:36:32,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:36:32,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:36:32,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:36:32,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:36:32,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:36:32,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:36:32,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:36:32,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:36:32,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:36:32,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:36:32,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:36:32,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:36:32,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:36:32,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:36:32,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:36:32,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:36:32,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:36:32,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:36:32,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:36:32,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:36:32,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:36:32,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:36:32,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:36:32,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:36:32,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:36:32,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:36:32,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:36:32,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:36:32,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:36:32,482 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:36:32,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:36:32,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:36:32,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:36:32,515 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:36:32,516 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:36:32,516 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:36:32,516 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:36:32,516 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:36:32,517 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:36:32,517 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:36:32,517 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:36:32,517 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:36:32,518 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:36:32,518 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:36:32,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:36:32,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:36:32,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:36:32,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:36:32,519 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:36:32,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:36:32,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:36:32,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:36:32,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:36:32,521 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:36:32,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:36:32,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:36:32,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:36:32,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:36:32,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:36:32,522 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:36:32,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:36:32,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:36:32,523 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:36:32,523 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:36:32,523 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:36:32,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:36:32,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:36:32,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:36:32,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:36:32,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:36:32,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-12 20:36:32,667 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac760618/b368c91f7c364baf90bc2b6f81f19a77/FLAG70754a45d [2018-11-12 20:36:33,123 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:36:33,124 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-12 20:36:33,130 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac760618/b368c91f7c364baf90bc2b6f81f19a77/FLAG70754a45d [2018-11-12 20:36:33,145 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac760618/b368c91f7c364baf90bc2b6f81f19a77 [2018-11-12 20:36:33,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:36:33,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:36:33,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:36:33,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:36:33,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:36:33,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d32a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33, skipping insertion in model container [2018-11-12 20:36:33,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:36:33,199 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:36:33,428 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:36:33,432 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:36:33,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:36:33,478 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:36:33,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33 WrapperNode [2018-11-12 20:36:33,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:36:33,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:36:33,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:36:33,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:36:33,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:36:33,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:36:33,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:36:33,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:36:33,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... [2018-11-12 20:36:33,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:36:33,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:36:33,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:36:33,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:36:33,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:36:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:36:33,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:36:33,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:36:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:36:33,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:36:33,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:36:33,980 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:36:33,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:36:33 BoogieIcfgContainer [2018-11-12 20:36:33,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:36:33,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:36:33,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:36:33,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:36:33,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:36:33" (1/3) ... [2018-11-12 20:36:33,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cad85fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:36:33, skipping insertion in model container [2018-11-12 20:36:33,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:36:33" (2/3) ... [2018-11-12 20:36:33,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cad85fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:36:33, skipping insertion in model container [2018-11-12 20:36:33,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:36:33" (3/3) ... [2018-11-12 20:36:33,996 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-11-12 20:36:34,019 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:36:34,030 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:36:34,048 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:36:34,082 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:36:34,083 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:36:34,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:36:34,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:36:34,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:36:34,083 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:36:34,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:36:34,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:36:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-12 20:36:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:36:34,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:34,109 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:34,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:34,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1193744236, now seen corresponding path program 1 times [2018-11-12 20:36:34,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:34,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:34,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:34,244 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-12 20:36:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:36:34,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:36:34,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:36:34,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:36:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:36:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:36:34,268 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-12 20:36:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:34,290 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-12 20:36:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:36:34,292 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-12 20:36:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:34,299 INFO L225 Difference]: With dead ends: 43 [2018-11-12 20:36:34,299 INFO L226 Difference]: Without dead ends: 21 [2018-11-12 20:36:34,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:36:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-12 20:36:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-12 20:36:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-12 20:36:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-12 20:36:34,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-12 20:36:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:34,339 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-12 20:36:34,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:36:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-12 20:36:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:36:34,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:34,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:34,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:34,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1255135895, now seen corresponding path program 1 times [2018-11-12 20:36:34,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:34,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:34,419 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-12 20:36:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:36:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:36:34,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:36:34,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:36:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:36:34,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:36:34,422 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2018-11-12 20:36:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:34,492 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-12 20:36:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:36:34,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-12 20:36:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:34,496 INFO L225 Difference]: With dead ends: 41 [2018-11-12 20:36:34,496 INFO L226 Difference]: Without dead ends: 29 [2018-11-12 20:36:34,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:36:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-12 20:36:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-11-12 20:36:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-12 20:36:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-12 20:36:34,507 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-11-12 20:36:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:34,507 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-12 20:36:34,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:36:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-12 20:36:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:36:34,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:34,509 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:34,509 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:34,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1812131568, now seen corresponding path program 1 times [2018-11-12 20:36:34,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:34,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:34,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:34,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:34,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:34,627 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-11-12 20:36:34,629 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [39], [42], [44], [50], [51], [52], [54] [2018-11-12 20:36:34,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:36:34,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:36:34,787 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:36:35,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:36:35,015 INFO L272 AbstractInterpreter]: Visited 17 different actions 55 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Performed 243 root evaluator evaluations with a maximum evaluation depth of 6. Performed 243 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 2 different actions. Largest state had 17 variables. [2018-11-12 20:36:35,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:35,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:36:35,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:35,069 INFO L192 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-12 20:36:35,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:35,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:35,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:35,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-12 20:36:35,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-12 20:36:35,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-12 20:36:35,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-12 20:36:35,457 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:36:35,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-12 20:36:35,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-11-12 20:36:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:35,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:35,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-12 20:36:35,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-12 20:36:35,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:35,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:36:35,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:16 [2018-11-12 20:36:36,819 WARN L179 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:36:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:36,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:36,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2018-11-12 20:36:36,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:36,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:36:36,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:36:36,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:36:36,863 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-11-12 20:36:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:37,317 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-12 20:36:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:36:37,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-12 20:36:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:37,319 INFO L225 Difference]: With dead ends: 53 [2018-11-12 20:36:37,319 INFO L226 Difference]: Without dead ends: 41 [2018-11-12 20:36:37,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:36:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-12 20:36:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-11-12 20:36:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-12 20:36:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-12 20:36:37,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2018-11-12 20:36:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:37,330 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-12 20:36:37,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:36:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-12 20:36:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-12 20:36:37,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:37,331 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:37,331 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:37,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 602547482, now seen corresponding path program 1 times [2018-11-12 20:36:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:37,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:37,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:36:37,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:37,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:37,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-12 20:36:37,710 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [31], [33], [39], [42], [44], [47], [49], [50], [51], [52], [54], [55] [2018-11-12 20:36:37,712 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:36:37,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:36:37,724 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:36:38,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:36:38,099 INFO L272 AbstractInterpreter]: Visited 22 different actions 148 times. Merged at 9 different actions 70 times. Widened at 2 different actions 8 times. Performed 570 root evaluator evaluations with a maximum evaluation depth of 6. Performed 570 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 18 variables. [2018-11-12 20:36:38,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:38,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:36:38,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:38,138 INFO L192 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-12 20:36:38,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:38,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:36:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:38,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:36:38,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-12 20:36:38,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-12 20:36:38,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:36:38,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:38,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:36:38,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-11-12 20:36:39,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-12 20:36:39,443 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:36:39,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-12 20:36:39,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:36:39,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:39,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:36:39,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-11-12 20:36:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:43,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:43,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-12 20:36:43,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-12 20:36:43,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:36:43,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:36:43,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:36:43,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-12 20:36:45,023 WARN L179 SmtUtils]: Spent 867.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 20:36:45,300 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-12 20:36:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:45,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 21 [2018-11-12 20:36:45,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:45,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:36:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:36:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2018-11-12 20:36:45,336 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 12 states. [2018-11-12 20:36:58,223 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-12 20:37:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:00,609 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-12 20:37:00,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:37:00,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-12 20:37:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:00,611 INFO L225 Difference]: With dead ends: 72 [2018-11-12 20:37:00,611 INFO L226 Difference]: Without dead ends: 53 [2018-11-12 20:37:00,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=95, Invalid=503, Unknown=2, NotChecked=0, Total=600 [2018-11-12 20:37:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-12 20:37:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2018-11-12 20:37:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-12 20:37:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-12 20:37:00,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 30 [2018-11-12 20:37:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:00,625 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-12 20:37:00,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:37:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-12 20:37:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-12 20:37:00,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:00,627 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:00,627 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:00,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:00,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1500033328, now seen corresponding path program 2 times [2018-11-12 20:37:00,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:00,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:00,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:37:01,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:01,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:01,062 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:01,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:01,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:01,062 INFO L192 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-12 20:37:01,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:37:01,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:37:01,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:37:01,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:01,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:01,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-12 20:37:01,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-12 20:37:01,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:37:01,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:01,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:01,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-11-12 20:37:02,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-12 20:37:02,319 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:37:02,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-12 20:37:02,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:37:02,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:02,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:02,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-11-12 20:37:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:37:06,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:07,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-12 20:37:07,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-12 20:37:07,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:37:07,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:07,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:07,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-12 20:37:08,028 WARN L179 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:37:08,912 WARN L179 SmtUtils]: Spent 838.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:37:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:37:09,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:09,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 12] total 25 [2018-11-12 20:37:09,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:09,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:37:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:37:09,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=517, Unknown=2, NotChecked=0, Total=600 [2018-11-12 20:37:09,029 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-11-12 20:37:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:32,574 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-12 20:37:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:37:32,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-12 20:37:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:32,577 INFO L225 Difference]: With dead ends: 89 [2018-11-12 20:37:32,577 INFO L226 Difference]: Without dead ends: 61 [2018-11-12 20:37:32,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=87, Invalid=561, Unknown=2, NotChecked=0, Total=650 [2018-11-12 20:37:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-12 20:37:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2018-11-12 20:37:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-12 20:37:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-12 20:37:32,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2018-11-12 20:37:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:32,590 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-12 20:37:32,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:37:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-12 20:37:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:37:32,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:32,592 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:32,592 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:32,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -207301449, now seen corresponding path program 3 times [2018-11-12 20:37:32,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:32,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:32,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:32,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:32,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:37:32,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:32,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:32,808 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:32,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:32,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:32,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:32,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:37:32,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:37:32,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:37:32,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:32,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:32,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-12 20:37:32,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-12 20:37:32,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:37:32,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:32,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:32,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-11-12 20:37:33,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-12 20:37:33,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-12 20:37:33,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-12 20:37:33,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:33,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:33,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2018-11-12 20:37:34,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-12 20:37:34,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:37:34,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-12 20:37:34,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:37:34,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:34,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:34,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-11-12 20:37:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:37:38,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:39,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-12 20:37:39,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-12 20:37:39,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:37:39,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:37:39,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:37:39,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-12 20:37:40,254 WARN L179 SmtUtils]: Spent 895.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:37:41,261 WARN L179 SmtUtils]: Spent 921.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:37:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:37:41,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 26 [2018-11-12 20:37:41,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:41,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:37:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:37:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=565, Unknown=2, NotChecked=0, Total=650 [2018-11-12 20:37:41,369 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-11-12 20:38:01,830 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-12 20:38:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:08,707 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-11-12 20:38:08,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:38:08,709 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-12 20:38:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:08,710 INFO L225 Difference]: With dead ends: 107 [2018-11-12 20:38:08,710 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:38:08,711 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=120, Invalid=808, Unknown=2, NotChecked=0, Total=930 [2018-11-12 20:38:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:38:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-12 20:38:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-12 20:38:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-12 20:38:08,726 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 45 [2018-11-12 20:38:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:08,726 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-12 20:38:08,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:38:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-12 20:38:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-12 20:38:08,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:08,729 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:08,729 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:08,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash -597350463, now seen corresponding path program 4 times [2018-11-12 20:38:08,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:08,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:38:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:08,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 20:38:08,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:08,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:08,903 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:08,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:08,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:08,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:08,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:08,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:38:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:08,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:09,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-12 20:38:09,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-12 20:38:09,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:38:09,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:38:09,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:38:09,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-12 20:38:09,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-12 20:38:09,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-12 20:38:09,171 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-12 20:38:09,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:38:09,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-12 20:38:09,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:56 [2018-11-12 20:38:11,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-12 20:38:11,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:38:11,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-12 20:38:11,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:38:11,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:38:11,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:38:11,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-11-12 20:38:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 67 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:38:12,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:38:12,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-12 20:38:12,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-12 20:38:12,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:38:12,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:38:12,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:38:12,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-12 20:38:13,528 WARN L179 SmtUtils]: Spent 871.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:38:14,503 WARN L179 SmtUtils]: Spent 879.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:38:15,545 WARN L179 SmtUtils]: Spent 924.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:38:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:38:15,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:38:15,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 33 [2018-11-12 20:38:15,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:38:15,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:38:15,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:38:15,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=938, Unknown=1, NotChecked=0, Total=1056 [2018-11-12 20:38:15,707 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2018-11-12 20:38:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:38:33,039 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-12 20:38:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:38:33,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-11-12 20:38:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:38:33,042 INFO L225 Difference]: With dead ends: 122 [2018-11-12 20:38:33,042 INFO L226 Difference]: Without dead ends: 85 [2018-11-12 20:38:33,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=159, Invalid=1246, Unknown=1, NotChecked=0, Total=1406 [2018-11-12 20:38:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-12 20:38:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2018-11-12 20:38:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-12 20:38:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-12 20:38:33,060 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 57 [2018-11-12 20:38:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:38:33,061 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-12 20:38:33,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:38:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-12 20:38:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-12 20:38:33,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:38:33,062 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:38:33,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:38:33,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:38:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1336655223, now seen corresponding path program 5 times [2018-11-12 20:38:33,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:38:33,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:33,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:38:33,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:38:33,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:38:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:38:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:38:33,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:33,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:38:33,357 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:38:33,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:38:33,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:38:33,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:38:33,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:38:33,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:38:34,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:38:34,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:38:34,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:38:34,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-11-12 20:38:34,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-12 20:38:34,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:38:34,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:38:34,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:38:34,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-12 20:38:34,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-12 20:38:34,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 50 [2018-11-12 20:38:34,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-12 20:38:34,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:38:34,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:38:34,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:56 [2018-11-12 20:39:04,921 WARN L179 SmtUtils]: Spent 7.38 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-12 20:39:13,190 WARN L179 SmtUtils]: Spent 4.83 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-12 20:39:25,756 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2018-11-12 20:39:29,830 WARN L179 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 44 [2018-11-12 20:39:47,430 WARN L832 $PredicateComparison]: unable to prove that (and (exists ((|v_main_~#array~0.base_BEFORE_CALL_19| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#array~0.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_19|))) (and (let ((.cse0 (mod (+ v_prenex_19 4294967295) 4294967296))) (< .cse0 (mod (select .cse1 (+ (* 4 .cse0) |v_main_~#array~0.offset_BEFORE_CALL_19|)) 4294967296))) (<= (+ (* 4294967296 (div (+ v_prenex_20 (* 4294967296 (div (+ v_prenex_20 4294957292) 4294967296)) 4294967291) 4294967296)) 4) v_prenex_20) (let ((.cse2 (mod v_prenex_20 4294967296))) (< .cse2 (mod (select .cse1 (+ (* 4 .cse2) |v_main_~#array~0.offset_BEFORE_CALL_19|)) 4294967296))) (<= 10000 (mod v_prenex_19 4294967296)) (<= 4 v_prenex_20)))) (= 2 c_main_~index~0) (exists ((v_prenex_21 Int)) (and (let ((.cse3 (mod v_prenex_21 4294967296))) (< .cse3 (mod (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse3) |c_main_~#array~0.offset|)) 4294967296))) (<= (+ (* 4294967296 (div (+ v_prenex_21 (* 4294967296 (div (+ v_prenex_21 4294957292) 4294967296)) 4294967291) 4294967296)) 4) v_prenex_21) (<= 4 v_prenex_21))) (exists ((v_prenex_22 Int)) (and (<= 10000 (mod v_prenex_22 4294967296)) (let ((.cse4 (mod (+ v_prenex_22 4294967295) 4294967296))) (< .cse4 (mod (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse4) |c_main_~#array~0.offset|)) 4294967296)))))) is different from false [2018-11-12 20:39:54,782 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2018-11-12 20:40:06,411 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2018-11-12 20:40:17,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-12 20:40:17,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:40:17,622 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:40:17,630 INFO L303 Elim1Store]: Index analysis took 168 ms [2018-11-12 20:40:17,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-11-12 20:40:17,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:40:17,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:40:17,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:40:17,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:86, output treesize:32 [2018-11-12 20:40:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 7 proven. 98 refuted. 16 times theorem prover too weak. 4 trivial. 6 not checked. [2018-11-12 20:40:21,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:42,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-12 20:40:42,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-12 20:40:42,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:40:42,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:40:42,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:40:42,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-12 20:40:46,735 WARN L179 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 20:40:49,819 WARN L179 SmtUtils]: Spent 803.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:40:59,852 WARN L179 SmtUtils]: Spent 881.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 20:41:03,788 WARN L179 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 20:41:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 99 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:41:03,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 18] total 47 [2018-11-12 20:41:03,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:03,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:41:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:41:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1793, Unknown=40, NotChecked=88, Total=2162 [2018-11-12 20:41:03,848 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 31 states. Received shutdown request... [2018-11-12 20:41:18,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:41:18,554 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:41:18,558 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:41:18,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:41:18 BoogieIcfgContainer [2018-11-12 20:41:18,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:41:18,559 INFO L168 Benchmark]: Toolchain (without parser) took 285402.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -865.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:41:18,559 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-12 20:41:18,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.12 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:18,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:41:18,561 INFO L168 Benchmark]: Boogie Preprocessor took 26.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:41:18,561 INFO L168 Benchmark]: RCFGBuilder took 445.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:18,562 INFO L168 Benchmark]: TraceAbstraction took 284576.04 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 109.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -81.1 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2018-11-12 20:41:18,567 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 321.12 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 445.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 284576.04 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 109.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -81.1 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 12). Cancelled while BasicCegarLoop was constructing difference of abstraction (72states) and FLOYD_HOARE automaton (currently 9 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. TIMEOUT Result, 284.4s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 98.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 212 SDtfs, 215 SDslu, 1347 SDs, 0 SdLazy, 1298 SolverSat, 132 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 88.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 376 SyntacticMatches, 40 SemanticMatches, 175 ConstructedPredicates, 1 IntricatePredicates, 5 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 187.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 182.7s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 792 ConstructedInterpolants, 200 QuantifiedInterpolants, 701867 SizeOfPredicates, 71 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 270/918 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown